Inclusion and exclusion algorithm for the Hamiltonian path problem
From MaRDI portal
Publication:689624
DOI10.1016/0020-0190(93)90033-6zbMath0778.68069MaRDI QIDQ689624
Publication date: 15 November 1993
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(93)90033-6
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
Related Items
Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs, On partitioning a graph into two connected subgraphs, Complexity of counting cycles using zeons, Set multi-covering via inclusion-exclusion, Exact algorithms for exact satisfiability and number of perfect matchings, An exact algorithm for subgraph homeomorphism, Algorithms to count paths and cycles, Open problems around exact algorithms, Exact algorithms for the Hamiltonian cycle problem in planar graphs, Faster Steiner Tree Computation in Polynomial-Space
Cites Work