1729 search results - page 213 / 346 » On Bounds for the k-Partitioning of Graphs |
185
click to vote
WEA
2010
Springer
15 years 11 months ago
2010
Springer
Maximizing the quality index modularity has become one of the primary methods for identifying the clustering structure within a graph. As contemporary networks are not static but e...
156
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
Let G be an unweighted graph of complexity n cellularly embedded in a surface (orientable or not) of genus g. We describe improved algorithms to compute (the length of) a shortest...
158
click to vote
GD
1999
Springer
15 years 10 months ago
1999
Springer
In this paper we address the problem of drawing planar graphs with circular arcs while maintaining good angular resolution and small drawing area. We present a lower bound on the a...
161
click to vote
ESA
1998
Springer
15 years 10 months ago
1998
Springer
We present a new approach for designing external graph algorithms and use it to design simple, deterministic and randomized external algorithms for computing connected components, ...
186
click to vote
STOC
1992
ACM
15 years 10 months ago
1992
ACM
Given an expander graph G = (V, E) and a set of q disjoint pairs of vertices in V , we are interested in finding for each pair (ai, bi), a path connecting ai to bi, such that the ...