On Steiner Minimal Trees in Grid Graphs and Its Application to VLSI Routing.
Michael KaufmannShaodi GaoKrishnaiyan ThulasiramanPublished in: ISAAC (1994)
Keyphrases
- decision trees
- steiner tree
- signal processing
- graph theory
- vlsi design
- tree structured data
- grid computing
- routing protocol
- high speed
- minimum spanning tree
- graph theoretic
- network topology
- routing algorithm
- tree structure
- shortest path
- weighted graph
- graph model
- bipartite graph
- graph representation
- mobile ad hoc networks
- maximal cliques
- graph structure
- graph matching
- ad hoc networks
- random graphs
- grid points
- bounded degree
- attributed graphs
- vlsi implementation
- network topologies
- routing problem
- graph databases