Optimal Leaf Ordering of Complete Binary Trees

to connected objects

Location
Deutsche Nationalbibliothek Frankfurt am Main
Extent
Online-Ressource
Language
Englisch

Bibliographic citation
In: Journal of Discrete Algorithms ; 5 (2007), 3. - S. 546-552

Classification
Informatik

Event
Veröffentlichung
(where)
Konstanz
(who)
Bibliothek der Universität Konstanz
(when)
2007
Creator

URN
urn:nbn:de:bsz:352-opus-117791
Rights
Der Zugriff auf das Objekt ist unbeschränkt möglich.
Last update
15.08.2025, 7:34 AM CEST

Data provider

This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Show original at data provider

Associated

Time of origin

  • 2007

Other Objects (12)

Eager st-Ordering

Eager st-Ordering

Eager st-Ordering

Eager st-Ordering

Layout of graph visualizations

Hochschulschrift

Layout of graph visualizations

Faster Evaluation of Shortest-Path Based Centrality Indices

Faster Evaluation of Shortest-Path Based Centrality Indices

Layout of Graph Visualizations

Hochschulschrift | Online-Publikation

Layout of Graph Visualizations

Orthogonal-Ordering Constraints are Tough

Orthogonal-Ordering Constraints are Tough

More canonical ordering

More canonical ordering

Leftist canonical ordering

Leftist canonical ordering

Network analysis : methodological foundations

Konferenzschrift | Kongress

Network analysis : methodological foundations

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

Dynamic Grid Embedding with Few Bends and Changes

Dynamic Grid Embedding with Few Bends and Changes

A Faster Algorithm for Betweenness Centrality

A Faster Algorithm for Betweenness Centrality

Related objects