1201 search results - page 47 / 241 » Linear Probing and Graphs |
205
click to vote
WADS
2007
Springer
16 years 1 months ago
2007
Springer
We present a polynomial-time approximation scheme (PTAS) for the Steiner tree problem with polygonal obstacles in the plane with running time O(n log2 n), where n denotes the numb...
168
Voted
ACTAC
2007
15 years 7 months ago
2007
An o-line scheduling algorithm considers resource, precedence, and synchronisation requirements of a task graph, and generates a schedule guaranteeing its timing requirements. Th...
156
click to vote
EJC
2007
15 years 7 months ago
2007
3 We define four families of geometries with as point graph the graph — or its complement — of all elliptic 4 hyperplanes of a given parabolic quadric in any finite 6-dimensi...
181
click to vote
GD
2005
Springer
16 years 27 days ago
2005
Springer
We present a reduction method that reduces a graph to a smaller core graph which behaves invariant with respect to planarity measures like crossing number, skewness, and thickness....
151
Voted
GD
2001
Springer
15 years 12 months ago
2001
Springer
We give a characterization of DFS cotree-critical graphs which is central to the linear time Kuratowski finding algorithm implemented in PIGALE (Public Implementation of a Graph ...