Fast Hamiltonicity Checking Via Bases of Perfect Matchings (Q4561499)

From MaRDI portal
Revision as of 10:18, 6 May 2024 by EloiFerrer (talk | contribs) (‎Merged Item from Q5495800)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6326964
  • Fast hamiltonicity checking via bases of perfect matchings
Language Label Description Also known as
English
Fast Hamiltonicity Checking Via Bases of Perfect Matchings
scientific article; zbMATH DE number 6326964
  • Fast hamiltonicity checking via bases of perfect matchings

Statements

Fast Hamiltonicity Checking Via Bases of Perfect Matchings (English)
0 references
Fast hamiltonicity checking via bases of perfect matchings (English)
0 references
0 references
0 references
0 references
0 references
0 references
0 references
6 December 2018
0 references
7 August 2014
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
Hamiltonicity
0 references
bounded treewidth
0 references
matchings
0 references
parameterized complexity
0 references
dynamic programming
0 references
matrix rank
0 references
pathwidth
0 references
perfect matchings
0 references
randomized algorithm
0 references
0 references
0 references
0 references