Computing Graph Polynomials on Graphs of Bounded Clique-Width.
Johann A. MakowskyUdi RoticsIlya AverbouchBenny GodlinPublished in: WG (2006)
Keyphrases
- graph properties
- maximum clique
- quasi cliques
- independent set
- graph representation
- graph theory
- graph construction
- graph theoretic
- directed graph
- maximum independent set
- bounded treewidth
- graph structure
- weighted graph
- graph databases
- graph matching
- labeled graphs
- bounded degree
- graph mining
- adjacency matrix
- maximum weight
- graph structures
- graph model
- graph classification
- random graphs
- subgraph isomorphism
- maximal cliques
- graph search
- graph clustering
- maximal clique enumeration
- structural pattern recognition
- association graph
- graph data
- graph theoretical
- graph isomorphism
- series parallel
- undirected graph
- lagrange interpolation
- dense subgraphs
- bipartite graph
- graph partitioning
- graph representations
- reachability queries
- spanning tree
- massive graphs
- neighborhood graph
- graph transformation
- maximum cardinality
- connected dominating set
- dynamic graph
- real world graphs
- query graph
- minimum spanning tree
- graph patterns
- graphical models
- graph embedding
- np complete
- attributed graphs
- graph kernels
- random walk
- minimum weight
- evolving graphs
- finding the shortest path
- connected graphs
- inexact graph matching
- structured data
- graph layout
- pattern mining