Hamiltonian cycle reconfiguration with answer set programming
From MaRDI portal
Publication:6545539
DOI10.1007/978-3-031-43619-2_19MaRDI QIDQ6545539
Xiao-Nan Lu, Takehide Soh, Naoyuki Tamura, Torsten Schaub, Takahiro Hirate, Katsumi Inoue, Hidetomo Nabeshima, Mutsunori Banbara
Publication date: 29 May 2024
Cites Work
- A dichotomy theorem for circular colouring reconfiguration
- Reconfiguration of dominating sets
- Complexity of independent set reconfigurability problems
- The complexity of dominating set reconfiguration
- On the complexity of reconfiguration problems
- Reconfiguration of list edge-colorings in a graph
- Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances
- Logic programs with stable model semantics as a constraint programming paradigm
- Chinese remainder encoding for Hamiltonian cycles
- Introduction to reconfiguration
- Complexity of Hamiltonian cycle reconfiguration
- The complexity of change
- Incremental SAT-Based Method with Native Boolean Cardinality Handling for the Hamiltonian Cycle Problem
- Reconfiguration of Cliques in a Graph
- Finding paths between 3-colorings
- Answer Set Programming Modulo Acyclicity
- Knowledge Representation, Reasoning and Declarative Problem Solving
- Reducibility among Combinatorial Problems
- Answer Set Programming
- Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas
- FHCP Challenge Set: The First Set of Structurally Difficult Instances of the Hamiltonian Cycle Problem
- On the Parameterized Complexity for Token Jumping on Graphs
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
Related Items (2)
Combinatorial reconfiguration with answer set programming: algorithms, encodings, and empirical analysis ⋮ Fast enumeration of all cost-bounded solutions for combinatorial problems using ZDDs
This page was built for publication: Hamiltonian cycle reconfiguration with answer set programming
