Characterization of classical graph classes by weighted clique graphs.
Flavia BonomoJayme Luiz SzwarcfiterPublished in: CTW (2011)
Keyphrases
- maximum weight
- weighted graph
- maximum clique
- association graph
- graph properties
- independent set
- quasi cliques
- graph theory
- graph theoretic
- bipartite graph
- graph model
- edge weights
- graph structure
- directed graph
- graph matching
- graph representation
- maximum independent set
- adjacency matrix
- spectral graph
- graph construction
- labeled graphs
- graph partitioning
- graph clustering
- graph mining
- subgraph isomorphism
- bounded degree
- graph classification
- maximal cliques
- maximal clique enumeration
- graph structures
- graph databases
- spanning tree
- minimum weight
- graph search
- reachability queries
- minimum spanning tree
- series parallel
- graph kernels
- random graphs
- graph data
- graph isomorphism
- similarity graph
- betweenness centrality
- real world graphs
- graph transformation
- dynamic graph
- directed acyclic
- connected components
- evolving graphs
- shortest path
- web graph
- graph representations
- massive graphs
- maximum cardinality
- connected graphs
- graphical models