Core Challenge 2022: Solver and Graph Descriptions

Soh, Tomoki; Ito, Teruaki

doi:10.48550/arxiv.2208.02495

Cited by 2 publications

(1 citation statement)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As a result, in the n = 50 scenario, the tpierron team achieved a reconfiguration sequence length of 3410 compared to our length of 3069, and in the n = 100 case, they reached a length of 3495250 compared to our length of 3145725. For more details on their submission, see "Graph track description" by Nicolas Bousquet, Bastien Durain, and Theo Pierron in the Core 2022 booklet [34].…”

Section: Other Graph Construction Algorithmsmentioning

confidence: 99%

PARIS: Planning Algorithms for Reconfiguring Independent Sets

Christen,

Eriksson,

Katz

et al. 2023

Frontiers in Artificial Intelligence and Applications

View full text Add to dashboard Cite

Combinatorial reconfiguration is the problem of transforming one solution of a combinatorial problem into another, where each transformation may only apply small changes to a solution and may not leave the solution space. An important example is the independent set reconfiguration (ISR) problem, where an independent set of a graph (a subset of its vertices without edges between them) has to be transformed into another by a sequence of transformations that can replace a vertex in the current subset such that the new subset is still an independent set. The 1st Combinatorial Reconfiguration Challenge (CoRe Challenge 2022) was a competition focused on the ISR problem. The PARIS team successfully participated with two solvers that model the ISR problem as a planning task and employ different planning techniques for solving it. In this work, we describe these models and solvers. For a fair comparison to competing ISR approaches, we re-run the entire competition under equal computational conditions. Besides showcasing the success of planning technology, we hope that this work will create a cross-fertilization of the two research fields.

show abstract

Section: Other Graph Construction Algorithmsmentioning

confidence: 99%