Polynomial time computability of some graph parameters for superclasses of perfect graphs.
Arnaud PêcherAnnegret Katrin WaglerPublished in: Int. J. Math. Oper. Res. (2012)
Keyphrases
- graph isomorphism
- graph structure
- graph theory
- graph representation
- bounded treewidth
- graph matching
- weighted graph
- directed graph
- graph construction
- polynomial time complexity
- graph theoretic
- graph structures
- labeled graphs
- graph mining
- planar graphs
- graph databases
- random graphs
- graph model
- adjacency matrix
- graph partitioning
- graph data
- graph clustering
- graph classification
- graph theoretical
- bipartite graph
- graph kernels
- dynamic graph
- graph search
- np complete
- connected dominating set
- maximum clique
- graph transformation
- bounded degree
- dense subgraphs
- computational complexity
- random walk
- undirected graph
- series parallel
- directed acyclic
- structural pattern recognition
- structured data
- edge weights
- graph properties
- minimum spanning tree
- graphical structure
- spanning tree
- graph drawing
- graph patterns
- neighborhood graph
- subgraph isomorphism
- small world
- reachability queries
- graph representations
- graphical models
- inexact graph matching
- special case