Vertex Cover Reconfiguration and Beyond (Q2942651)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Vertex Cover Reconfiguration and Beyond	scientific article

Statements

scholarly article

0 references

Vertex Cover Reconfiguration and Beyond (English)

0 references

Amer E. Mouawad

0 references

Naomi Nishimura

0 references

Venkatesh Raman

0 references

Algorithms and Computation

0 references

publication date

11 September 2015

0 references

full work available at URL

https://arxiv.org/abs/1402.4926

0 references

MaRDI profile type

MaRDI publication profile

0 references

The Complexity of Rerouting Shortest Paths

0 references

Connectedness of the graph of vertex-colourings

0 references

0 references

On the parameterized complexity of multiple-interval graph problems

0 references

Local search: is brute-force avoidable?

0 references

Some simplified NP-complete graph problems

0 references

The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies

0 references

PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation

0 references

On the complexity of reconfiguration problems

0 references

Complexity of independent set reconfigurability problems

0 references

On the parameterized complexity of reconfiguration problems

0 references

Reconfiguration of dominating sets

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-319-13075-0_36

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2942651

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2942651&oldid=36200323"