An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph.
Philippe G. H. LehotPublished in: J. ACM (1974)
Keyphrases
- graph structure
- graph based algorithm
- detection algorithm
- dynamic programming
- tree structure
- minimum spanning tree
- k means
- worst case
- optimal solution
- np hard
- cost function
- random walk
- breadth first search
- undirected graph
- detection method
- solution path
- depth first search
- weighted graph
- graph model
- spanning tree
- globally optimal
- graph theoretical
- input data
- preprocessing
- graph construction
- graph search
- graph theory
- segmentation algorithm
- matching algorithm
- clustering method
- finding the shortest path
- search space
- maximum flow
- learning algorithm
- closed form
- shortest path problem
- approximation algorithms
- random graphs
- graph partitioning
- shortest path
- graph matching
- bipartite graph
- computational complexity
- data structure
- adjacency graph
- min sum
- polynomial time complexity
- graph databases