✦ LIBER ✦

Algorithms for Constructing Hierarchical Graphs

Book ID: 114669778
Publisher: Institute of Electrical and Electronics Engineers
Year: 1974
Weight: 731 KB
Volume: SMC-4
Category: Article
ISSN: 0018-9472
DOI: 10.1109/tsmc.1974.4309341

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Efficient Algorithm for Constructing

An Efficient Algorithm for Constructing Hierarchical Graphs

✍ Yelowitz, Lawrence 📂 Article 📅 1976 🏛 Institute of Electrical and Electronics Engineers ⚖ 520 KB

Algorithms for constructing minimal dedu

Algorithms for constructing minimal deduction graphs

✍ Yang, C.-C.; Chen, J.J.-Y.; Chau, H.L. 📂 Article 📅 1989 🏛 IEEE 🌐 English ⚖ 988 KB

Straight-Line Drawing Algorithms for Hie

Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs

✍ Peter Eades; Qingwen Feng; Xuemin Lin; Hiroshi Nagamochi 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 422 KB

Edge crossing minimization algorithm for

Edge crossing minimization algorithm for hierarchical graphs based on Genetic Algorithms

✍ Shen Wei-xiang; Huang Jing-wei 📂 Article 📅 2001 🏛 Wuhan University 🌐 English ⚖ 486 KB

Boolean Matrix Method for the Constructi

Boolean Matrix Method for the Construction of Hierarchical Graphs

📂 Article 📅 1978 🏛 Institute of Electrical and Electronics Engineers ⚖ 610 KB

Algorithms for constructing graphs and d

Algorithms for constructing graphs and digraphs with given valences and factors

✍ D.J. Kleitman; D.L. Wang 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 942 KB

Given a set of valences ( ui) such that { ui> and (vi-k} are both realizable as valences of graphs without loops or multiple edges, an explicit conslruction method is described for obtaining a graph with valences {ui] having a k-factor. A number of extensions of the result are obtained. Similar resu