D.I.E.I. - Università degli Studi di Perugia h-quasi planar drawings of bounded treewidth graphs in linear area Emilio Di Giacomo, Walter Didimo, Giuseppe.
Distribution of maximal clique size under
Fall 2010Parallel Processing, Fundamental ConceptsSlide 2 3.1 Asymptotic Complexity Fig. 3.1 Graphical representation of the notions of asymptotic complexity.
1 Graph Coloring with Ants ThanhVu H. Nguyen Department of Computer Science Penn State Harrisburg (Advisor: Dr. Thang N. Bui)
Chapter 1 Fundamental Concepts II Pao-Lien Lai 1.
DISTRIBUTION OF MAXIMAL CLIQUE SIZE UNDER THE WATTS-STROGATZ MODEL OF EVOLUTION OF COMPLEX NETWORKS
Competitive Paging Algorithms Amos Fiat, Richard Karp, Michael Luby, Lyle McGeoch, Daniel Sleator, Neal Young presented by Seth Phillips.
