- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
In: Graph Drawing / Marks, Joe (Hrsg.). - Berlin, Heidelberg : Springer Berlin Heidelberg, 2002. - (Lecture Notes in Computer Science ; 1984). - S. 103-114. - ISBN 978-3-540-41554-1
- Klassifikation
-
Management
- Ereignis
-
Veröffentlichung
- (wo)
-
Konstanz
- (wer)
-
Bibliothek der Universität Konstanz
- (wann)
-
2009
- Urheber
-
Brandes, Ulrik
Cornelsen, Sabine
Wagner, Dorothea
- URN
-
urn:nbn:de:bsz:352-opus-73461
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:54 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
- Brandes, Ulrik
- Cornelsen, Sabine
- Wagner, Dorothea
- Bibliothek der Universität Konstanz
Entstanden
- 2009
Ähnliche Objekte (12)
How to draw the minimum cuts of a planar graph
NP-Completeness Results for Minimum Planar Spanners
Layout of graph visualizations
Faster Evaluation of Shortest-Path Based Centrality Indices
Eager st-Ordering
Layout of Graph Visualizations
A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs
Edge-Disjoint Paths in Planar Graphs with Short Total Length
A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs
A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs (Extended Abstract)
Characterizing Families of Cuts That Can Be Represented by Axis-Parallel Rectangles
Characterizing Families of Cuts that can be Represented by Axis-Parallel Rectangles
How to draw the minimum cuts of a planar graph
NP-Completeness Results for Minimum Planar Spanners
Layout of graph visualizations
Faster Evaluation of Shortest-Path Based Centrality Indices
Eager st-Ordering
Layout of Graph Visualizations
A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs
Edge-Disjoint Paths in Planar Graphs with Short Total Length
A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs
A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs (Extended Abstract)
Characterizing Families of Cuts That Can Be Represented by Axis-Parallel Rectangles
Characterizing Families of Cuts that can be Represented by Axis-Parallel Rectangles
How to draw the minimum cuts of a planar graph
NP-Completeness Results for Minimum Planar Spanners
Layout of graph visualizations
Faster Evaluation of Shortest-Path Based Centrality Indices
Eager st-Ordering
Layout of Graph Visualizations
A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs
Edge-Disjoint Paths in Planar Graphs with Short Total Length
A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs
A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs (Extended Abstract)
Characterizing Families of Cuts That Can Be Represented by Axis-Parallel Rectangles