Finding Paths between Graph Colourings: PSPACE-completeness and Superpolynomial Distances
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
Finding Paths between Graph Colourings: PSPACE-completeness and Superpolynomial Distances ; 2007, 21
Preprint Reihe Mathematik ; 2007, 21
- Classification
-
Mathematik
- Creator
-
Bonsma, Paul
Cereceda, Luis
- DOI
-
10.14279/depositonce-14393
- Handle
-
11303/15620
- URN
-
urn:nbn:de:101:1-2021122201110750866597
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:33 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Bonsma, Paul
- Cereceda, Luis
Other Objects (12)
Finding Disjoint Paths on Directed Acyclic Graphs
Finding k Shortest Paths in Cayley Graphs of Finite Groups
Graph algorithms and NP-completeness
Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs
Increasing distances in graphs
Finding Supported Paths in Heterogeneous Networks
Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor
On stochastic completeness of weighted graphs
Flip Distances Between Graph Orientations
Flip distances between graph orientations
Lightweight paths in graphs
An algorithmic approach for finding the fuzzy constrained shortest paths in a fuzzy graph
Finding Disjoint Paths on Directed Acyclic Graphs
Finding k Shortest Paths in Cayley Graphs of Finite Groups
Graph algorithms and NP-completeness
Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs
Increasing distances in graphs
Finding Supported Paths in Heterogeneous Networks
Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor
On stochastic completeness of weighted graphs
Flip Distances Between Graph Orientations
Flip distances between graph orientations
Lightweight paths in graphs
An algorithmic approach for finding the fuzzy constrained shortest paths in a fuzzy graph
Finding Disjoint Paths on Directed Acyclic Graphs
Finding k Shortest Paths in Cayley Graphs of Finite Groups
Graph algorithms and NP-completeness
Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs
Increasing distances in graphs
Finding Supported Paths in Heterogeneous Networks
Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor
On stochastic completeness of weighted graphs
Flip Distances Between Graph Orientations
Flip distances between graph orientations
Lightweight paths in graphs