An Almost Linear-Time Algorithm for Graph Realization.
Robert E. BixbyDonald K. WagnerPublished in: Math. Oper. Res. (1988)
Keyphrases
- detection algorithm
- experimental evaluation
- learning algorithm
- worst case
- graph based algorithm
- cost function
- times faster
- neural network
- computational complexity
- preprocessing
- computational cost
- dominating set
- shortest path problem
- spanning tree
- recognition algorithm
- matching algorithm
- dynamic programming
- np hard
- search space
- objective function
- linear programming
- probabilistic model
- convergence rate
- graph theory
- graph structure
- undirected graph
- maximum flow
- maximum weight
- optimal solution