- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
In: Journal of Graph Algorithms and Applications ; 15 (2011), 1. - S. 97-126
- Classification
-
Informatik
- Event
-
Veröffentlichung
- (where)
-
Konstanz
- (who)
-
Bibliothek der Universität Konstanz
- (when)
-
2012
- Creator
- URN
-
urn:nbn:de:bsz:352-179849
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:51 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
- Badent, Melanie
- Brandes, Ulrik
- Cornelsen, Sabine
- Bibliothek der Universität Konstanz
Time of origin
- 2012
Other Objects (12)
Eager st-Ordering
Leftist canonical ordering
Eager st-Ordering
Optimal Leaf Ordering of Complete Binary Trees
Layout of graph visualizations
Faster Evaluation of Shortest-Path Based Centrality Indices
Layout of Graph Visualizations
Orthogonal-Ordering Constraints are Tough
More flexible radial layout
More flexible radial layout
Network analysis : methodological foundations
A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs
Eager st-Ordering
Leftist canonical ordering
Eager st-Ordering
Optimal Leaf Ordering of Complete Binary Trees
Layout of graph visualizations
Faster Evaluation of Shortest-Path Based Centrality Indices
Layout of Graph Visualizations
Orthogonal-Ordering Constraints are Tough
More flexible radial layout
More flexible radial layout
Network analysis : methodological foundations
A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs
Eager st-Ordering
Leftist canonical ordering
Eager st-Ordering
Optimal Leaf Ordering of Complete Binary Trees
Layout of graph visualizations
Faster Evaluation of Shortest-Path Based Centrality Indices
Layout of Graph Visualizations
Orthogonal-Ordering Constraints are Tough
More flexible radial layout
More flexible radial layout
Network analysis : methodological foundations