Amanote Research
Register
Sign In
Efficient Steiner Tree Construction Based on Spanning Graphs
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- United States
doi 10.1109/tcad.2004.826557
Full Text
Open PDF
Abstract
Available in
full text
Categories
Electrical
Software
Computer Graphics
Computer-Aided Design
Electronic Engineering
Date
May 1, 2004
Authors
H. Zhou
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Related search
Parallel Minimum Spanning Tree Heuristic for the Steiner Problem in Graphs
Obstacle-Avoiding Rectilinear Steiner Tree Construction
Laplacian Matrices and Spanning Trees of Tree Graphs
Annales de la faculté des sciences de Toulouse Mathématiques
Performance of a Cavity-Method-Based Algorithm for the Prize-Collecting Steiner Tree Problem on Graphs
Physical Review E
One-Class Classifiers Based on Entropic Spanning Graphs
IEEE Transactions on Neural Networks and Learning Systems
Computer Networks
Software
Computer Science Applications
Artificial Intelligence
Communications
The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
A Spanning Tree Method for Bounding Hitting Times of Random Walks on Graphs
SIAM Journal on Discrete Mathematics
Mathematics
The Minimum Steiner Tree Problem Based on Genetic Algorithm
DEStech Transactions on Computer Science and Engineering
On Steiner Domination Number of Graphs
International Journal of Mathematics Trends and Technology
