On limitations of transformations between combinatorial problems

DOI10.1007/BF02090395zbMATH Open0806.05059OpenAlexW2046961627MaRDI QIDQ3979606FDOQ3979606

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

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

zbMATH Keywords

combinatorial problemslocal replacementlocal transformationssingle edge transformationsurface complexity

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Node-Deletion NP-Complete Problems
• Some simplified NP-complete graph problems
• Communication complexity
• ``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)