On limitations of transformations between combinatorial problems

DOI10.1007/BF02090395zbMath0806.05059OpenAlexW2046961627MaRDI QIDQ3979606

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Communication complexity
• Some simplified NP-complete graph problems
• ``Global graph problems tend to be intractable
• Node-Deletion NP-Complete Problems

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