44 search results - page 6 / 9 » Edge-Disjoint Spanning Trees, Edge Connectivity, and Eigenva... |
163
click to vote
ESA
1998
Springer
15 years 10 months ago
1998
Springer
We present a new approach for designing external graph algorithms and use it to design simple, deterministic and randomized external algorithms for computing connected components, ...
189
click to vote
STACS
2007
Springer
16 years 16 days ago
2007
Springer
An orthogonal spanner network for a given set of n points in the plane is a plane straight line graph with axis-aligned edges that connects all input points. We show that for any ...
181
click to vote
JGT
2008
15 years 6 months ago
2008
: We develop a general model of edge spaces in order to generalize, unify, and simplify previous work on cycle spaces of infinite graphs. We give simple topological criteria to sho...
152
click to vote
ICRA
2005
IEEE
16 years 1 days ago
2005
IEEE
Abstract - This paper presents an improvement over a previous contour closure algorithm. Assuming that edge points are given as input, the proposed approach consists of two steps. ...
211
click to vote
WWW
2007
ACM
16 years 7 months ago
2007
ACM
Hierarchical models are commonly used to organize a Website's content. A Website's content structure can be represented by a topic hierarchy, a directed tree rooted at a...