- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
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
- Classification
-
Management
- Event
-
Veröffentlichung
- (where)
-
Konstanz
- (who)
-
Bibliothek der Universität Konstanz
- (when)
-
2009
- Creator
-
Brandes, Ulrik
Cornelsen, Sabine
Wagner, Dorothea
- URN
-
urn:nbn:de:bsz:352-opus-73461
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
2025-08-14T10:54:40+0200
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
- Brandes, Ulrik
- Cornelsen, Sabine
- Wagner, Dorothea
- Bibliothek der Universität Konstanz
Time of origin
- 2009
Other Objects (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