Paper Info
Title
Enumerating Perfect Matchings in n-Cubes.
Abstract
The perfect matchings in the n-cube have earlier been enumerated for n a parts per thousand currency signaEuro parts per thousand 6. A dynamic programming approach is here used to obtain the total number of perfect matchings in the 7-cube, which is 391 689 748 492 473 664 721 077 609 089. The number of equivalence classes of perfect matchings is further shown to be 336 in the 5-cube, 356 788 059 in the 6-cube and 607 158 046 495 120 886 820 621 in the 7-cube. The techniques used can be generalized to arbitrary bipartite and general graphs.
Year
DOI
Venue
2013
10.1007/s11083-012-9279-8
ORDER-A JOURNAL ON THE THEORY OF ORDERED SETS AND ITS APPLICATIONS
Keywords
DocType
Volume
Perfect matching,N-cube,Dynamic programming,Enumeration
Journal
30.0
Issue
ISSN
Citations 
3
0167-8094
2
PageRank 
References 
Authors
0.40
5
2
Name
Order
Citations
PageRank
Patric R. J. Östergård160970.61
Ville Pettersson2111.82