116 search results - page 2 / 24 » Fast Heuristics for the Edge Coloring of Large Graphs |
GD
2009
Springer
13 years 9 months ago
2009
Springer
To produce high quality drawings of graphs with nodes drawn as shapes it is important to find routes for the edges which do not intersect node boundaries. Recent work in this area...
ACCV
2010
Springer
13 years 7 days ago
2010
Springer
Recent work on early vision such as image segmentation, image restoration, stereo matching, and optical flow models these problems using Markov Random Fields. Although this formula...
CIKM
2009
Springer
13 years 11 months ago
2009
Springer
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
ESA
2004
Springer
13 years 10 months ago
2004
Springer
We show the first o(n2 ) algorithm for coloring vertices of trianglefree planar graphs using three colors. The time complexity of the algorithm is O(n log n). Our approach can be ...
FSTTCS
2000
Springer
13 years 8 months ago
2000
Springer
We investigate a variant of on-line edge-coloring in which there is a fixed number of colors availableandtheaimistocolorasmanyedgesaspossible.Weproveupperandlowerboundsontheperform...