270 search results - page 3 / 54 » Matching graphs of Hypercubes and Complete Bipartite Graphs |
IPL
2010
13 years 3 months ago
2010
Polynomial algorithms are given for the following two problems:
JCO
2000
13 years 5 months ago
2000
We show that the problem of finding a perfect matching satisfying a single equality constraint with a 0
STOC
1993
ACM
13 years 9 months ago
1993
ACM
We consider a class of routing problems on connected graphs G. Initially, each vertex v of G is occupied by a “pebble” which has a unique destination π(v) in G (so that π is...
IWOCA
2009
Springer
13 years 10 months ago
2009
Springer
R. H¨aggkvist proved that every 3-regular bipartite graph of order 2n with no component isomorphic to the Heawood graph decomposes the complete bipartite graph K6n,6n. In [2] the ...
DM
1998
13 years 5 months ago
1998
An embedding of Kn into a hypercube is a mapping of the n vertices of Kn to distinct vertices of the hypercube, and the associated cost is the sum over all pairs of (mapped) verti...