✦ LIBER ✦

Efficient Steiner tree construction based on spanning graphs

✍ Scribed by Hai Zhou

Book ID: 117907152
Publisher: IEEE
Year: 2004
Tongue: English
Weight: 357 KB
Volume: 23
Category: Article
ISSN: 0278-0070
DOI: 10.1109/tcad.2004.826557

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Obstacle-Avoiding Rectilinear Steiner Tr

Obstacle-Avoiding Rectilinear Steiner Tree Construction Based on Spanning Graphs

✍ Chung-Wei Lin; Szu-Yu Chen; Chi-Feng Li; Yao-Wen Chang; Chia-Lin Yang 📂 Article 📅 2008 🏛 IEEE 🌐 English ⚖ 923 KB

Spanning graph-based nonrectilinear stei

Spanning graph-based nonrectilinear steiner tree algorithms

✍ Qi Zhu; Hai Zhou; Tong Jing; Hong, X.-L.; Yang Yang 📂 Article 📅 2005 🏛 IEEE 🌐 English ⚖ 566 KB

Constructing full spanning trees for cub

Constructing full spanning trees for cubic graphs

✍ James A. Storer 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 513 KB

Efficient minimum spanning tree construc

Efficient minimum spanning tree construction without Delaunay triangulation

✍ Hai Zhou; Narendra Shenoy; William Nicholls 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 77 KB

Given n points in a plane, a minimum spanning tree is a set of edges which connects all the points and has a minimum total length. A naive approach enumerates edges on all pairs of points and takes at least (n 2 ) time. More efficient approaches find a minimum spanning tree only among edges in the D

Multilayer chip-level global routing usi

Multilayer chip-level global routing using an efficient graph-based Steiner tree heuristic

✍ Liu, L.-C.E.; Sechen, C. 📂 Article 📅 1999 🏛 IEEE 🌐 English ⚖ 323 KB

Modeling hop-constrained and diameter-co

Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs

✍ Luis Gouveia; Luidi Simonetti; Eduardo Uchoa 📂 Article 📅 2009 🏛 Springer-Verlag 🌐 English ⚖ 452 KB