[1]
Armin Buscher and Thorsten Holz, Tracking DDoS Attacks: Insights into the Business of Disrupting the Web, https: /www. usenix. org/system/files/conference/leet12/leet12-final26. pdf , (2012).
Google Scholar
[2]
Bibai J, Saveant P, Schoenauer M and Vidal V. An Evolutionary Metaheuristic Based on State Decomposition for Domain-Independent Satisfying Planning. 2010. http: /www. aaai. org.
Google Scholar
[3]
Albert-László Barabási. The network takeover. NATURE PHYSICS VOL. 8 JANUARY 2012 www. nature. com/naturephysics.
Google Scholar
[4]
Mark Hopkins. LAYERWIDTH: Analysis of a New Metric for Directed Acyclic Graphs. In Proceedings of the Ninetheenth Conference on Uncertainty in Artificial Intelligence, San Francisco: CA, Morgan Kaufmann Publishers, 321-328, (2003).
Google Scholar
[5]
Roberto Bruni, Fabio Gadducci, Alberto Lluch Lafuente. An Algebra of Hierarchical Graphs and its Application to Structural Encoding. Scientific Annals of computer science, (2010).
Google Scholar
[6]
J. S. Vitter. Algorithms and Data Structures for External Memory, Series on Foundations and Trends in Theoretical Computer Science, Now Publishers, Hanover, MA, 2008. Also published as Volume 2, Issue 4 of Foundations and Trends in Theoretical Computer Science.
DOI: 10.1561/0400000014
Google Scholar
[7]
Alfonso Gerevini, Alessandro Saetti, Ivan Serina. Temporal Planning with Problems Requiring Concurrency through Action Graphs and Local Search. ICAPS (2010).
DOI: 10.1609/icaps.v20i1.13433
Google Scholar
[8]
Ulrich Meyer, Vitaly Osipov. Design and Implementation of a Practical I/O-efficient Shortest Paths Algorithm. (2009).
Google Scholar
[9]
D. J. Pearce, Paul H. J. Kelly. Dynamic Topological Sort Algorithm for Directed Acyclic Graphs. ACM Journal of Experimental Algorithmics, Vol. 11, Article No. 1. 7, 2006, pp.1-24.
DOI: 10.1145/1187436.1210590
Google Scholar