1101 search results - page 142 / 221 » An Algorithm for the Graph Crossing Number Problem |
134
Voted
WG
2007
Springer
15 years 8 months ago
2007
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...
122
Voted
SIROCCO
2004
15 years 4 months ago
2004
Path Layout is a fundamental graph problem in label switching protocols. This problem is raised in various protocols such as the traditional ATM protocol and MPLS which is a new l...
146
Voted
AAAI
2010
15 years 4 months ago
2010
We present novel randomized algorithms for solving global motion planning problems that exploit the computational capabilities of many-core GPUs. Our approach uses thread and data...
143
Voted
WINE
2005
Springer
15 years 8 months ago
2005
Springer
Consider a network vulnerable to viral infection. The system security software can guarantee safety only to a limited part of the network. Such limitations result from economy cos...
148
Voted
ISAAC
2009
Springer
15 years 9 months ago
2009
Springer
We present an algorithm that for any graph G and integer k ≥ 0 in time polynomial in the size of G either nds a spanning tree with at least k internal vertices, or outputs a ne...