MaxCut on permutation graphs is NP-complete.
Celina M. H. de FigueiredoAlexsander Andrade de MeloFabiano de S. OliveiraAna SilvaPublished in: J. Graph Theory (2023)
Keyphrases
- np complete
- polynomial time complexity
- bounded treewidth
- randomly generated
- np hard
- satisfiability problem
- constraint satisfaction problems
- computational complexity
- connected graphs
- pspace complete
- random graphs
- graph representation
- directed graph
- graph mining
- graph model
- graph matching
- data complexity
- graph theoretic
- weighted graph
- conjunctive queries
- graph theory
- phase transition
- series parallel
- labeled graphs
- pattern mining
- special case