NP-hard graph problems and boundary classes of graphs.
Vladimir E. AlekseevRodica BoliacDmitry V. KorobitsynVadim V. LozinPublished in: Theor. Comput. Sci. (2007)
Keyphrases
- np hard
- graph representation
- weighted graph
- np complete
- maximum independent set
- decision problems
- directed graph
- graph theory
- graph structure
- optimal solution
- computationally challenging
- np hardness
- graph construction
- graph mining
- bipartite graph
- graph layout
- polynomial time complexity
- graph isomorphism
- labeled graphs
- structural pattern recognition
- graph classification
- maximum common subgraph
- maximum weight
- planar graphs
- graph theoretical
- computationally hard
- edge weights
- graph databases
- minimum cost
- graph model
- structured data
- linear programming
- special case