A polynomial time algorithm for determining zero Euler-Petrie genus of an Eulerian graph.
Brigitte ServatiusHerman ServatiusPublished in: Discret. Math. (2002)
Keyphrases
- computational complexity
- computational cost
- k means
- learning algorithm
- dynamic programming
- worst case
- simulated annealing
- objective function
- graph isomorphism
- segmentation algorithm
- cost function
- random walk
- expectation maximization
- depth first search
- np hard
- probabilistic model
- np complete
- special case
- tree structure
- connected components
- graph matching
- graph model
- graph partitioning
- minimum spanning tree
- search algorithm
- graph construction
- optimal solution
- polynomial time complexity