Structure theorem and algorithm on (1, f)-odd subgraph.
Mikio KanoGyula Y. KatonaPublished in: Discret. Math. (2007)
Keyphrases
- dynamic programming
- times faster
- np hard
- cost function
- experimental evaluation
- search space
- objective function
- improved algorithm
- detection algorithm
- preprocessing
- learning algorithm
- computational cost
- worst case
- computationally efficient
- optimization algorithm
- computational complexity
- clustering method
- matching algorithm
- convex hull
- graph structure
- lower bound
- segmentation algorithm
- tree structure
- classification algorithm
- optimal solution