On limitations of transformations between combinatorial problems

DOI10.1007/BF02090395MaRDI QIDQ3979606zbMATH OpenOpenAlexFDO

Authors W. Slough, Karl Winklmann

Publication date 26 June 1992

Published in Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02090395

zbMATH Keywords

combinatorial problemslocal replacementlocal transformationssingle edge transformationsurface complexity

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Survey of polynomial transformations between NP-complete problems
• The complexity of change
• On the complexity of reconfiguration problems
• On the Complexity of Reconfiguration Problems
• scientific article; zbMATH DE number 3858462

Cites work

• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Communication complexity
• Node-Deletion NP-Complete Problems
• Some simplified NP-complete graph problems
• ``Global graph problems tend to be intractable

Cited in

(1)

• Survey of polynomial transformations between NP-complete problems

This page was built for publication: On limitations of transformations between combinatorial problems

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