1951 search results - page 166 / 391 » An algorithm for improving graph partitions |
146
click to vote
ICML
2007
IEEE
16 years 5 months ago
2007
IEEE
By the term "quantization", we refer to the process of using quantum mechanics in order to improve a classical algorithm, usually by making it go faster. In this paper, ...
129
click to vote
SWAT
2004
Springer
15 years 10 months ago
2004
Springer
We present improved cache-oblivious data structures and algorithms for breadth-first search and the single-source shortest path problem on undirected graphs with non-negative edge...
154
Voted
CIAC
2003
Springer
15 years 10 months ago
2003
Springer
Abstract. In this paper we show that every chordal graph with n vertices and m edges admits an additive 4-spanner with at most 2n−2 edges and an additive 3-spanner with at most O...
152
Voted
IPCO
1993
15 years 6 months ago
1993
The survivable network design problem (SNDP) is to construct a minimum-cost subgraph satisfying certain given edge-connectivity requirements. The first polynomial-time approximati...
137
click to vote
FCT
1995
Springer
15 years 8 months ago
1995
Springer
Abstract. We present algorithms for maintaining shortest path information in dynamic outerplanar digraphs with sublogarithmic query time. By choosing appropriate parameters we achi...