43 search results - page 1 / 9 » Matching and edge-connectivity in regular graphs |
SIAMDM
2010
14 years 5 months ago
2010
79
Voted
COCOON
2009
Springer
15 years 5 months ago
2009
Springer
It is shown that for every finite set of disjoint convex polygonal obstacles in the plane, with a total of n vertices, the free space around the obstacles can be partitioned into ...
STOC
2001
ACM
15 years 10 months ago
2001
ACM
We show that we can maintain up to polylogarithmic edge connectivity for a fully-dynamic graph in ~O(pn) time per edge insertion or deletion. Within logarithmic factors, this matc...
DM
2007
14 years 10 months ago
2007
Krishnamoorthy, Thulasiraman and Swamy [Minimum order graphs with specified diameter, connectivity and regularity, Networks 19 (1989) 25–46] showed that a δ-regular graph with...
LATIN
2000
Springer
15 years 2 months ago
2000
Springer
We look at the minimal size of a maximal matching in general, bipartite and