1986 search results - page 74 / 398 » Path Separability of Graphs |
124
Voted
ISAAC
2004
Springer
15 years 7 months ago
2004
Springer
Let G be a graph containing N disjoint t-spanners that are inter-connected with M edges. We present an algorithm that constructs a data structure of size O(M2 + n log n) that answ...
100
Voted
EUROGRAPHICS
2010
Eurographics
15 years 11 months ago
2010
Eurographics
Clothoid splines are gaining popularity as a curve representation due to their intrinsically pleasing curvature, which varies piecewise linearly over arc length. However, construc...
115
Voted
ICNP
2000
IEEE
15 years 6 months ago
2000
IEEE
We present a protocol for maintaining multiple paths to each destination in a network of processes. For each destination, each process in the network maintains a set of neighbors ...
130
click to vote
SIAMDM
2010
15 years 22 days ago
2010
K¨orner and Malvenuto asked whether one can find n n/2 linear orderings (i.e., permutations) of the first n natural numbers such that any pair of them places two consecutive int...
109
click to vote
MFCS
2004
Springer
15 years 7 months ago
2004
Springer
Let G = (V, E) be a (directed) graph with vertex set V and edge (arc) set E. Given a set P of (source-sink) pairs of vertices of G, an important problem that arises in the computat...