Finding Bounded Path in Graph Using SMT for Automatic Clock Routing.
Amit ErezAlexander NadelPublished in: CAV (2) (2015)
Keyphrases
- shortest path
- strongly connected
- path selection
- random walk
- solution path
- shortest path problem
- weighted graph
- semi automatic
- graph model
- graph representation
- graph theory
- graph structure
- fully automatic
- path length
- directed graph
- source node
- graphical models
- multiple paths
- maximum clique
- graph theoretic
- network topology
- routing algorithm
- edge weights
- graph mining
- bipartite graph
- ad hoc networks
- power consumption
- high speed
- packet transmission