2314 search results - page 129 / 463 » Minimal Partitions of a Graph |
126
Voted
ALGORITHMS
2010
15 years 1 months ago
2010
: Graph search algorithms have exploited graph extremities, such as the leaves of a tree and the simplicial vertices of a chordal graph. Recently, several well-known graph search a...
114
Voted
ESA
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. The depth of a planar embedding is a measure of the topological nesting of the biconnected components of the graph. Minimizing the depth of planar embeddings has importan...
139
Voted
EUROGRAPHICS
2010
Eurographics
16 years 25 days ago
2010
Eurographics
We provide a simple method that extracts an isosurface that is manifold and intersection-free from a function over an arbitrary octree. Our method samples the function dual to min...
140
Voted
PIMRC
2008
IEEE
15 years 10 months ago
2008
IEEE
—This paper considers the performance of the MAC protocols ALOHA and CSMA in wireless ad hoc networks, where the total system bandwidth may be divided into smaller subbands. In t...
272
Voted
DAWAK
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. In this paper, we present a new approach to indexing multidimensional data that is particularly suitable for the efficient incremental processing of nearest neighbor quer...