147 search results - page 22 / 30 » Cycle decompositions of the complete graph |
RECOMB
1999
Springer
14 years 7 days ago
1999
Springer
The abundance of information provided by completely sequenced genomes de nes a starting point for new insights in the multilevel organization of organisms and their evolution. At ...
ICCV
2007
IEEE
14 years 2 months ago
2007
IEEE
The matching of planar shapes can be cast as a problem of finding the shortest path through a graph spanned by the two shapes, where the nodes of the graph encode the local simil...
DISOPT
2006
13 years 8 months ago
2006
While it was known for a long time how to transform an asymmetric traveling salesman problem on the complete graph with n vertices into a symmetric traveling salesman problem on a...
SIAMDM
2010
13 years 6 months ago
2010
We study grooming for two-period optical networks, a variation of the traffic grooming problem for WDM ring networks introduced by Colbourn, Quattrocchi, and Syrotiuk. In the two-...
JCT
2010
13 years 6 months ago
2010
Abstract. A weighting of the edges of a graph is called vertexcoloring if the weighted degrees of the vertices yield a proper coloring of the graph. In this paper we show that such...