The P versus NP-complete dichotomy of some challenging problems in graph theory.
Celina M. H. de FigueiredoPublished in: Discret. Appl. Math. (2012)
Keyphrases
- np complete
- graph theory
- computer vision and pattern recognition
- maximum independent set
- computational complexity
- social network analysis
- graph theoretic
- graph theoretical
- complex networks
- graph properties
- minimum spanning tree
- graph based representations
- genetic algorithm
- maximal cliques
- randomly generated
- satisfiability problem
- constraint satisfaction problems