- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
In: Algorithmica (83:) - London [u.a.] : SpringerNature - S. 116-143
- Ereignis
-
Veröffentlichung
- (wo)
-
Berlin
- (wer)
-
Technische Universität Berlin
- (wann)
-
2021
- Urheber
-
Aichholzer, Oswin
Cardinal, Jean
Huynh, Tony
Knauer, Kolja
Mütze, Torsten
Steiner, Raphael
Vogtenhuber, Birgit
- DOI
-
10.14279/depositonce-11656
- Handle
-
11303/12856
- URN
-
urn:nbn:de:101:1-2021032400571499241975
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:23 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Aichholzer, Oswin
- Cardinal, Jean
- Huynh, Tony
- Knauer, Kolja
- Mütze, Torsten
- Steiner, Raphael
- Vogtenhuber, Birgit
- Technische Universität Berlin
Entstanden
- 2021
Ähnliche Objekte (12)
Flip Distances Between Graph Orientations
Distances Between Immersed Graphs: Metric Properties
Flip colouring of graphs
Increasing distances in graphs
Acyclic orientations of mixed graphs
Flips & Partitions in Geometric Graphs
Finding Paths between Graph Colourings: PSPACE-completeness and Superpolynomial Distances
Generalized tournaments and efficient orientations of graphs
Linear Distances between Markov Chains
Connectivity of Triangulation Flip Graphs in the Plane
Fixed-Parameter Tractable Distances to Sparse Graph Classes
Exact algorithms for network design problems using graph orientations
Flip Distances Between Graph Orientations
Distances Between Immersed Graphs: Metric Properties
Flip colouring of graphs
Increasing distances in graphs
Acyclic orientations of mixed graphs
Flips & Partitions in Geometric Graphs
Finding Paths between Graph Colourings: PSPACE-completeness and Superpolynomial Distances
Generalized tournaments and efficient orientations of graphs
Linear Distances between Markov Chains
Connectivity of Triangulation Flip Graphs in the Plane
Fixed-Parameter Tractable Distances to Sparse Graph Classes
Exact algorithms for network design problems using graph orientations
Flip Distances Between Graph Orientations
Distances Between Immersed Graphs: Metric Properties
Flip colouring of graphs
Increasing distances in graphs
Acyclic orientations of mixed graphs
Flips & Partitions in Geometric Graphs
Finding Paths between Graph Colourings: PSPACE-completeness and Superpolynomial Distances
Generalized tournaments and efficient orientations of graphs
Linear Distances between Markov Chains
Connectivity of Triangulation Flip Graphs in the Plane
Fixed-Parameter Tractable Distances to Sparse Graph Classes