Showing cs.DSShow all
2 papers · 1 filter
cs.DS2026
Finding Shortest Reconfiguration Sequences on Independent Set Polytopes
Jean Cardinal, Kevin Mann, Akira Suzuki +3
We initiate the study of the shortest reconfiguration problem for independent sets under the adjacency relation derived from the independent set polytope. Given a graph and two ind…
cs.DS2023
Shortest paths on polymatroids and hypergraphic polytopes
Jean Cardinal, Raphael Steiner
Base polytopes of polymatroids, also known as generalized permutohedra, are polytopes whose edges are parallel to a vector of the form . We consider th…