MaxCut on Permutation Graphs is NP-complete.
Celina M. H. de FigueiredoAlexsander Andrade de MeloFabiano de S. OliveiraAna SilvaPublished in: CoRR (2022)
Keyphrases
- np complete
- polynomial time complexity
- bounded treewidth
- np hard
- satisfiability problem
- randomly generated
- constraint satisfaction problems
- computational complexity
- phase transition
- conjunctive queries
- graph mining
- graph matching
- graph theory
- connected graphs
- conp complete
- constraint satisfaction
- np complete problems
- series parallel
- graph theoretic
- graph structure
- random graphs
- undirected graph
- minimum cost
- data sets
- directed graph
- social networks