1395 search results - page 54 / 279 » (k, )-Distance-Hereditary Graphs |
145
click to vote
STACS
2010
Springer
15 years 11 months ago
2010
Springer
In 2000 Alber et al. [SWAT 2000 ] obtained the first parameterized subexponential algorithm on undirected planar graphs by showing that k-DOMINATING SET is solvable in time 2O( ...
140
click to vote
FOCS
2008
IEEE
15 years 11 months ago
2008
IEEE
We study the properties of embeddings, multicommodity flows, and sparse cuts in minor-closed families of graphs which are also closed under 2-sums; this includes planar graphs, g...
120
click to vote
GD
2004
Springer
15 years 9 months ago
2004
Springer
We propose a method for drawing AS graph data using 2.5D graph visualization. In order to bring out the pure graph structure of the AS graph we consider its core hierarchy. The k-c...
145
click to vote
FOCS
2006
IEEE
15 years 10 months ago
2006
IEEE
An additive spanner of an unweighted undirected graph G with distortion d is a subgraph H such that for any two vertices u, v ∈ G, we have δH(u, v) ≤ δG(u, v) + d. For every...
124
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
The packing chromatic number (G) of a graph G is the least integer k for which there exists a mapping f from V (G) to {1, 2, . . ., k} such that any two vertices of color i