Drawing a tree as a minimum spanning tree approximation (Q414909): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(7 intermediate revisions by 6 users not shown) | |||
Property / author | |||
Property / author: Henk G. Meijer / rank | |||
Property / author | |||
Property / author: Henk G. Meijer / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68R10 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6033506 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
graph drawing | |||
Property / zbMATH Keywords: graph drawing / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
geometric graphs | |||
Property / zbMATH Keywords: geometric graphs / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Euclidean minimum spanning tree | |||
Property / zbMATH Keywords: Euclidean minimum spanning tree / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
approximated proximity | |||
Property / zbMATH Keywords: approximated proximity / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.jcss.2011.06.001 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2089168252 / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q62042451 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A near-linear area bound for drawing binary trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4219187 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3154375 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Drawing a Tree as a Minimum Spanning Tree Approximation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Drawing Trees with Perfect Angular Resolution and Polynomial Area / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The realization problem for Euclidean minimum spanning trees is NP-hard / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Polynomial Area Bounds for MST Embeddings of Trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Drawing graphs. Methods and models / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Computing proximity drawings of trees in the 3-dimensional space / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Transitions in geometric minimum spanning trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Universality considerations in VLSI circuits / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 05:16, 5 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Drawing a tree as a minimum spanning tree approximation |
scientific article |
Statements
Drawing a tree as a minimum spanning tree approximation (English)
0 references
11 May 2012
0 references
graph drawing
0 references
geometric graphs
0 references
Euclidean minimum spanning tree
0 references
approximated proximity
0 references