Computing distances is FPT on graph associahedra and W[2]-hard on hypergraphic polytopes

MaRDI QIDQ7175136arXivFDO

Authors Luís Felipe Ignácio Cunha, Ignasi Sau, Uéverton S. Souza, Mario Valencia-Pabon

Publication date 2026

Published in arXiv

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Combinatorial optimization (90C27)

arXiv classification

cs.DS

This page was built for publication: Computing distances is FPT on graph associahedra and W[2]-hard on hypergraphic polytopes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7175136)