4865 search results - page 183 / 973 » The Complexity of Graph Connectivity |
120
Voted
EDBTW
2004
Springer
15 years 9 months ago
2004
Springer
While there are many proposals for path indexes on XML documents, none of them is perfectly suited for indexing large-scale collections of interlinked XML documents. Existing strat...
118
Voted
TOG
2002
15 years 3 months ago
2002
Efficient algorithms for compressing geometric data have been widely developed in the recent years, but they are mainly designed for closed polyhedral surfaces which are manifold ...
127
Voted
ESA
1998
Springer
15 years 8 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, ...
126
click to vote
GPEM
2006
15 years 3 months ago
2006
There are various representations for encoding graph structures, such as artificial neural networks (ANNs) and circuits, each with its own strengths and weaknesses. Here we analyz...
108
Voted
DM
2000
15 years 3 months ago
2000
For integers p; q; s with p