Fast Hamiltonicity Checking Via Bases of Perfect Matchings
Work
Year: 2018
Type: article
Abstract: For an even integer t ≥ 2, the Matching Connectivity matrix H t is a matrix that has rows and columns both labeled by all perfect matchings of the complete graph on t vertices; an entry H t [ M 1 , M ... more
Source: Journal of the ACM
Cites: 40
Cited by: 40
Related to: 10
FWCI: 5.36
Citation percentile (by year/subfield): 99.99
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Funder Narodowe Centrum Nauki
Grant ID UMO-2012/05/D/ST6/03214