Local edge-connectivity augmentation in hypergraphs is NP-complete.
Zoltán KirályBen CoshBill JacksonPublished in: Discret. Appl. Math. (2010)
Keyphrases
- np complete
- satisfiability problem
- np hard
- randomly generated
- computational complexity
- edge detection
- conjunctive queries
- edge information
- constraint satisfaction problems
- polynomially solvable
- disjoint paths
- pspace complete
- data sets
- phase transition
- edge detector
- strongly connected
- connected components
- polynomial time complexity
- medical images
- weighted graph
- higher order
- scheduling problem
- edge points
- bounded treewidth
- data management