✦ LIBER ✦

An Efficient Algorithm for Constructing Hierarchical Graphs

✍ Scribed by Yelowitz, Lawrence

Book ID: 114669984
Publisher: Institute of Electrical and Electronics Engineers
Year: 1976
Weight: 520 KB
Volume: SMC-6
Category: Article
ISSN: 0018-9472
DOI: 10.1109/tsmc.1976.5408785

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Algorithms for Constructing Hierarchical

Algorithms for Constructing Hierarchical Graphs

📂 Article 📅 1974 🏛 Institute of Electrical and Electronics Engineers ⚖ 731 KB

An efficient distributed algorithm for c

An efficient distributed algorithm for constructing small dominating sets

✍ Lujun Jia; Rajmohan Rajaraman; Torsten Suel 📂 Article 📅 2002 🏛 Springer-Verlag 🌐 English ⚖ 227 KB

An efficient algorithm for constructing

An efficient algorithm for constructing Hamiltonian paths in meshes

✍ Shao Dong Chen; Hong Shen; Rodney Topor 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 169 KB

This paper presents an efficient linear-time sequential algorithm for constructing Hamiltonian paths between two given vertices in meshes with horizontal size m and vertical size n. The algorithm first partitions the given mesh into a number of submeshes in constant steps, and then constructs a Hami

An efficient algorithm for constructing

An efficient algorithm for constructing nearly optimal prefix codes

✍ Mehlhorn, K. 📂 Article 📅 1980 🏛 IEEE 🌐 English ⚖ 608 KB

An algorithm for testing the planarity o

An algorithm for testing the planarity of a hierarchical graph

✍ Toshinobu Kashiwabara; Sumio Masuda 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 1004 KB

An Efficient Algorithm for Embedding Non

An Efficient Algorithm for Embedding Nonplanar Graphs in Planes

✍ A. Kaveh; H. Rahami 📂 Article 📅 2002 🏛 Springer Netherlands 🌐 English ⚖ 163 KB