A Heuristic for Minimum-Width Graph Layering with Consideration of Dummy Nodes.
Alexandre TarassovNikola S. NikolovJürgen BrankePublished in: WEA (2004)
Keyphrases
- graph structure
- directed graph
- spanning tree
- dominating set
- undirected graph
- minimum spanning tree
- adjacency matrix
- edge weights
- weighted graph
- minimum cost
- connected dominating set
- graph structures
- min sum
- graph search
- search algorithm
- random walk
- root node
- maximum independent set
- simulated annealing
- depth first search
- betweenness centrality
- connected graphs
- graph representation
- nodes of a graph
- small world
- strongly connected
- fully connected
- planar graphs
- attributed graphs
- optimal solution
- graph theory
- facility location problem
- combinatorial optimization
- average degree
- graph mining
- graph clustering
- greedy heuristic
- real world graphs
- bipartite graph
- directed edges
- graph matching
- graph databases
- connected components
- graph theoretic
- graph data
- path length
- breadth first search
- state space