𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Efficient Orthogonal Drawings of High Degree Graphs

✍ Scribed by A. Papakostas; I. G. Tollis

Book ID
106149273
Publisher
Springer
Year
2000
Tongue
English
Weight
476 KB
Volume
26
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Orthogonal drawings based on the stratif
Orthogonal drawings based on the stratification of planar graphs
✍ Nicolas Bonichon; Bertrand Le SaΓ«c; Mohamed Mosbah πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 237 KB

We propose a linear time algorithm that associates with any planar graph G a stratiΓΏcation having a particular layered spanning tree of G. Using this stratiΓΏcation, an algorithm to obtain a 2-visibility drawing of G is described.

Factorizations of regular graphs of high
Factorizations of regular graphs of high degree
✍ A. J. W. Hilton πŸ“‚ Article πŸ“… 1985 πŸ› John Wiley and Sons 🌐 English βš– 168 KB πŸ‘ 1 views

A p-factor of a graph G is a regular spanning subgraph of degree p . For G regular of degree d ( G ) and order 2n, let ( p l , ..., p,) be a partition of d ( G ) , so that p i > 0 ( I S i S r ) and p , i i pr = d(G). If H I . ..., H, are edge-disjoint regular spanning subgraphs of G of degrees p I ,