On the typical case complexity of graph optimization.
András FaragóPublished in: Discret. Appl. Math. (2005)
Keyphrases
- random walk
- optimization algorithm
- discrete optimization
- optimization problems
- worst case
- space complexity
- graph model
- global optimization
- graph structure
- weighted graph
- optimization process
- constrained optimization
- upper bound
- combinatorial optimization
- graphical representation
- graph theoretic
- complexity analysis
- structured data
- decision problems
- graph theory
- optimization methods
- graph matching
- optimization method
- directed graph
- connected components