760 search results - page 2 / 152 » Algorithms for Finding Distance-Edge-Colorings of Graphs |
JGAA
2006
13 years 5 months ago
2006
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...
OL
2010
12 years 12 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...
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...
GECCO
2006
Springer
13 years 8 months ago
2006
Springer
A spanning tree of a graph such that each vertex in the tree has degree at most d is called a degree-constrained spanning tree. The problem of finding the degree-constrained spann...
ISAAC
1992
Springer
13 years 9 months ago
1992
Springer
Let G be an undirected plane graph with non-negative edge length, and let k terminal pairs lie on two specified face boundaries. This paper presents an algorithm for finding k &quo...