2314 search results - page 150 / 463 » Minimal Partitions of a Graph |
162
click to vote
WADS
2007
Springer
15 years 10 months ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
150
Voted
TCS
2008
15 years 3 months ago
2008
1 Elimination Game is a well known algorithm that simulates Gaussian elimination of matrices on graphs, and it computes a triangulation of the input graph. The number of fill edge...
112
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We propose a new measure that quantifies the "closeness" between two nodes in a given graph. The calculation of the measure is linear in the number of edges in the graph...
118
Voted
DM
2006
15 years 3 months ago
2006
The pair length of a graph G is the maximum positive integer k, such that the vertex set of G can be partitioned into disjoint pairs {x, x }, such that d(x, x ) k for every x V (...
136
click to vote
SDM
2007
SIAM
15 years 5 months ago
2007
SIAM
We present an efficient dynamic algorithm for clustering undirected graphs, whose edge property is changing continuously. The algorithm maintains clusters of high quality in pres...