270 search results - page 4 / 54 » Matching graphs of Hypercubes and Complete Bipartite Graphs |
56
Voted
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Whiteley [9] gives a complete characterization of the infinitesimal flexes of complete bipartite frameworks. Our work generalizes a specific infinitesimal flex to include joined gr...
DM
2007
14 years 9 months ago
2007
In this paper it is shown that a class of almost-median graphs that includes all planar almost-median graphs can be recognized in O(m log n) time, where n denotes the number of ve...
LATIN
2000
Springer
15 years 1 months ago
2000
Springer
We look at the minimal size of a maximal matching in general, bipartite and
79
Voted
COCO
2010
Springer
14 years 7 months ago
2010
Springer
An even cycle in a graph is called nice by Lov
SIGECOM
2010
ACM
14 years 8 months ago
2010
ACM
We derive efficient algorithms for both detecting and representing matchings in lopsided bipartite graphs; such graphs have so many nodes on one side that it is infeasible to repr...