3267 search results - page 12 / 654 » Generalized quasirandom graphs |
ARSCOM
2007
13 years 7 months ago
2007
A graph U is (induced)-universal for a class of graphs X if every member of X is contained in U as an induced subgraph. We study the problem of finding a universal graph with min...
SODA
2012
ACM
11 years 9 months ago
2012
ACM
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...
DM
2008
13 years 7 months ago
2008
: Gould, Jacobson and Lehel (Combinatorics, Graph Theory and Algorithms, Vol.I (1999) 451
INFOCOM
2011
IEEE
12 years 10 months ago
2011
IEEE
—An approximate distance query data structure is a compact representation of a graph, and can be queried to approximate shortest paths between any pair of vertices. Any such data...
EDBT
2011
ACM
12 years 11 months ago
2011
ACM
Graph clustering has generally concerned itself with clustering undirected graphs; however the graphs from a number of important domains are essentially directed, e.g. networks of...