Characterization of classical graph classes by weighted clique graphs.
Flavia BonomoJayme Luiz SzwarcfiterPublished in: Discret. Appl. Math. (2014)
Keyphrases
- weighted graph
- maximum weight
- maximum clique
- association graph
- graph properties
- independent set
- quasi cliques
- bipartite graph
- graph theoretic
- graph model
- graph representation
- directed graph
- graph theory
- edge weights
- graph structure
- graph clustering
- maximum independent set
- graph matching
- labeled graphs
- adjacency matrix
- graph mining
- graph construction
- spectral graph
- graph databases
- graph partitioning
- series parallel
- graph classification
- spanning tree
- graph structures
- random graphs
- graph representations
- bounded degree
- subgraph isomorphism
- graph search
- shortest path
- minimum weight
- structural pattern recognition
- maximal cliques
- graph data
- undirected graph
- similarity graph
- web graph
- betweenness centrality
- directed acyclic
- graph theoretical
- query graph
- minimum spanning tree
- connected graphs
- reachability queries
- maximum common subgraph
- maximum cardinality
- random walk
- dense subgraphs
- dynamic graph
- equivalence classes
- adjacency graph
- clique tree
- topological information
- planar graphs
- evolving graphs
- finding the shortest path
- community discovery
- np complete
- maximal clique enumeration
- markov equivalence classes