1101 search results - page 20 / 221 » An Algorithm for the Graph Crossing Number Problem |
FSTTCS
2000
Springer
14 years 2 days ago
2000
Springer
We investigate a variant of on-line edge-coloring in which there is a fixed number of colors availableandtheaimistocolorasmanyedgesaspossible.Weproveupperandlowerboundsontheperform...
TCS
2008
13 years 8 months ago
2008
We consider the problem of periodic graph exploration by a finite automaton in which an automaton with a constant number of states has to explore all unknown anonymous graphs of a...
ISAAC
2005
Springer
14 years 2 months ago
2005
Springer
In an orthogonal drawing of a planar graph G, each vertex is drawn as a point, each edge is drawn as a sequence of alternate horizontal and vertical line segments, and any two edge...
NIPS
2008
13 years 10 months ago
2008
We show that an important and computationally challenging solution space feature of the graph coloring problem (COL), namely the number of clusters of solutions, can be accurately...
WG
2000
Springer
14 years 1 days ago
2000
Springer
: In a previous work, the authors introduced the class of graphs with bounded induced distance of order k, (BID(k) for short) to model non-reliable interconnection networks. A netw...