A Fast Algorithm for Finding an Optimal Ordering for Vertex Elimination on a Graph.
Tatsuo OhtsukiPublished in: SIAM J. Comput. (1976)
Keyphrases
- finding optimal
- directed graph
- strongly connected
- optimal solution
- random walk
- attributed graphs
- hamiltonian cycle
- maximum clique
- minimum weight
- undirected graph
- approximately optimal
- labeled graphs
- directed acyclic graph
- graph structure
- dynamic programming
- motion estimation
- worst case
- shortest path
- structured data
- connected components
- graph theory
- weighted graph
- bipartite graph
- partial order
- minimum spanning tree
- edge weights
- graph theoretic
- graph representation
- betweenness centrality
- average degree