760 search results - page 2 / 152 » Algorithms for finding clique-transversals of graphs |
COCOON
2005
Springer
13 years 10 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 ...
GBRPR
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We present a direct algorithm that computes a largest common connected induced subgraph of two given graphs. It is based on an efficient generation of the common connecte...
OL
2010
12 years 11 months ago
2010
This article studies a degree-bounded generalization of independent sets called co-k-plexes. Constant factor approximation algorithms are developed for the maximum co-k-plex probl...
WAOA
2007
Springer
13 years 11 months ago
2007
Springer
For a connected graph G, let L(G) denote the maximum number of leaves in a spanning tree in G. The problem of computing L(G) is known to be NP-hard even for cubic graphs. We improv...
FSTTCS
2010
Springer
13 years 2 months ago
2010
Springer
A spanner of a graph is a sparse subgraph that approximately preserves distances in the original graph. More precisely, a subgraph H = (V, EH ) is a k-spanner of a graph G = (V, E...