1101 search results - page 43 / 221 » An Algorithm for the Graph Crossing Number Problem |
125
click to vote
JGAA
2006
15 years 2 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...
116
Voted
GC
2007
Springer
15 years 2 months ago
2007
Springer
The pre-coloring extension problem consists, given a graph G and a set of nodes to which some colors are already assigned, in finding a coloring of G with the minimum number of co...
134
Voted
JAL
2006
15 years 2 months ago
2006
: We consider a variety of vehicle routing problems. The input to a problem consists of a graph G = (N, E) and edge lengths l(e) e E. Customers located at the vertices have to be ...
108
Voted
DISOPT
2010
15 years 2 months ago
2010
We consider labeled Traveling Salesman Problems, defined upon a complete graph of n vertices with colored edges. The objective is to find a tour of maximum or minimum number of co...
138
click to vote
ISAAC
2010
Springer
15 years 8 days ago
2010
Springer
The Induced Subgraph Isomorphism problem on two input graphs G and H is to decide whether G has an induced subgraph isomorphic to H. Already for the restricted case where H is a c...