1395 search results - page 101 / 279 » (k, )-Distance-Hereditary Graphs |
252
Voted
ICDE
2002
IEEE
16 years 5 months ago
2002
IEEE
XML and other semi-structured data may have partially specified or missing schema information, motivating the use of a structural summary which can be automatically computed from ...
121
click to vote
ESA
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We show that the k-Dominating Set problem is fixed parameter tractable (FPT) and has a polynomial kernel for any class of
115
click to vote
WADS
2001
Springer
15 years 8 months ago
2001
Springer
We show that there exists a linear time algorithm for deciding whether a graph of bounded tree-width has clique-width k for some fixed integer k. Communicated by Giuseppe Liotta ...
152
click to vote
COCOON
2005
Springer
15 years 9 months ago
2005
Springer
For a bounded integer , we wish to color all edges of a graph G so that any two edges within distance have different colors. Such a coloring is called a distance-edge-coloring or ...
120
click to vote
WG
2004
Springer
15 years 9 months ago
2004
Springer
We show how to use split decomposition to compute the weighted clique number and the chromatic number of a graph and we apply these results to some classes of graphs. In particular...