scientific article
From MaRDI portal
Publication:4027169
zbMath0768.68047MaRDI QIDQ4027169
Ondřej Zýka, Jan Kratochvíl, Jaroslav Nešetřil
Publication date: 21 February 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (11)
Pancyclicity in switching classes ⋮ What are the worst cases in constrained last-in-first-out pick-up and delivery problems? ⋮ Subgraph complementation ⋮ A survey of parameterized algorithms and the complexity of edge modification ⋮ Cutting a tree with subgraph complementation is hard, except for some small trees ⋮ Algorithmic aspects of switch cographs ⋮ Unnamed Item ⋮ Switching to Hedgehog-Free Graphs Is NP-Complete ⋮ On perfect switching classes ⋮ On perfect switching classes ⋮ Partial complementation of graphs
This page was built for publication:
