1729 search results - page 258 / 346 » Bound Graph Polysemy |
167
Voted
ICALP
2011
Springer
14 years 8 months ago
2011
Springer
We present an O( √ n log n)-approximation algorithm for the problem of finding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse ...
154
click to vote
PLDI
2004
ACM
15 years 10 months ago
2004
ACM
+ Modern network processors employ multi-threading to allow concurrency amongst multiple packet processing tasks. We studied the properties of applications running on the network p...
148
click to vote
SWAT
2004
Springer
15 years 10 months ago
2004
Springer
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the prio...
127
Voted
STOC
1999
ACM
15 years 9 months ago
1999
ACM
Given an undirected graph with edge costs and a subset of k ≥ 3 nodes called terminals, a multiway, or k-way, cut is a subset of the edges whose removal disconnects each termina...
155
click to vote
LATIN
2010
Springer
15 years 12 months ago
2010
Springer
Many divide-and-conquer algorithms employ the fact that the vertex set of a graph of bounded treewidth can be separated in two roughly balanced subsets by removing a small subset o...