A new algebraic technique for polynomial-time computing the number modulo 2 of Hamiltonian decompositions and similar partitions of a graph's edge set
Greg CohenPublished in: CoRR (2010)
Keyphrases
- polynomial time complexity
- small number
- undirected graph
- bounded degree
- fixed number
- maximum number
- finite number
- directed graph
- computational complexity
- small fraction
- vertex set
- initial set
- weighted graph
- stable set
- bipartite graph
- np complete
- clustering algorithm
- graph representation
- graph theoretic
- edge weights
- suboptimal solutions
- worst case