A Polynomial Time Algorithm for Recognizing Near-Bipartite Pfaffian Graphs.
Alberto Alexandre Assis MirandaCláudio Leonardo LucchesiPublished in: Electron. Notes Discret. Math. (2008)
Keyphrases
- learning algorithm
- dynamic programming
- computational complexity
- computational cost
- worst case
- preprocessing
- graph partitioning
- k means
- undirected graph
- graph model
- detection algorithm
- optimization algorithm
- strongly polynomial
- weighted graph
- segmentation algorithm
- np hard
- cost function
- optimal solution
- particle swarm optimization
- linear programming
- special case
- lower bound
- polynomial time approximation