An I/O-Efficient Algorithm for Computing Vertex Separators on Multi-Dimensional Grid Graphs and Its Applications.
Junhao GanYufei TaoPublished in: J. Graph Algorithms Appl. (2018)
Keyphrases
- multi dimensional
- dynamic programming
- learning algorithm
- undirected graph
- detection algorithm
- cost function
- search space
- optimization algorithm
- hamiltonian cycle
- matching algorithm
- adjacency graph
- np hard
- computational cost
- worst case
- preprocessing
- clustering method
- weighted graph
- grid structure
- maximum cardinality
- graph structure
- tree structure
- shortest path
- significant improvement
- k means
- optimal solution
- social networks