181 search results - page 5 / 37 » Fast Approximate Graph Partitioning Algorithms |
WAOA
2010
Springer
13 years 4 months ago
2010
Springer
The r-domination search game on graphs is a game-theoretical approach to several graph and hypergraph parameters including treewidth and hypertree width. The task is to identify t...
ESA
2007
Springer
14 years 15 days ago
2007
Springer
We present an experimental evaluation of an approximate distance oracle recently suggested by Thorup [1] for undirected planar graphs. The oracle uses the existence of graph separa...
CATS
2006
13 years 7 months ago
2006
We consider the following clustering problems: given a general undirected graph, partition its vertices into disjoint clusters such that each cluster forms a clique and the number...
SSDBM
2007
IEEE
14 years 18 days ago
2007
IEEE
We present a fast algorithm for computing approximate quantiles in high speed data streams with deterministic error bounds. For data streams of size N where N is unknown in advanc...
FOCS
2000
IEEE
13 years 10 months ago
2000
IEEE
A bisection of a graph with n vertices is a partition of its vertices into two sets, each of size n/2. The bisection cost is the number of edges connecting the two sets. The proble...