Shortest paths between shortest paths (Q719258)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Shortest paths between shortest paths	scientific article

Statements

scholarly article

0 references

Shortest paths between shortest paths (English)

0 references

0 references

Martin Milanič

0 references

Marcin Kaminski

0 references

Theoretical Computer Science

0 references

publication date

10 October 2011

0 references

zbMATH Keywords

reconfiguration

0 references

shortest path

0 references

reconfigurability

0 references

NP-hard

0 references

diameter

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.tcs.2011.05.021

0 references

Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances

0 references

Finding Paths between Graph Colourings: Computational Complexity and Possible Distances

0 references

Connectedness of the graph of vertex-colourings

0 references

Mixing 3-colourings in bipartite graphs

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

Reconfiguration of List Edge-Colorings in a Graph

0 references

Shortest Paths between Shortest Paths and Independent Sets

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/j.tcs.2011.05.021

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:719258

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