On the Power of Graph Searching for Cocomparability Graphs.
Derek G. CorneilJérémie DusartMichel HabibEkkehard KöhlerPublished in: SIAM J. Discret. Math. (2016)
Keyphrases
- graph representation
- graph theory
- graph structure
- graph matching
- weighted graph
- directed graph
- graph construction
- graph theoretic
- labeled graphs
- graph databases
- adjacency matrix
- graph clustering
- graph mining
- graph theoretical
- graph structures
- graph model
- graph classification
- graph search
- graph properties
- graph partitioning
- graph data
- graph isomorphism
- random graphs
- subgraph isomorphism
- bipartite graph
- series parallel
- undirected graph
- spanning tree
- graph kernels
- maximum common subgraph
- power consumption
- neighborhood graph
- dynamic graph
- structural pattern recognition
- connected graphs
- inexact graph matching
- graph representations
- graph layout
- graph edit distance
- disk resident
- graph transformation
- connected dominating set
- bounded treewidth
- minimum spanning tree
- attributed graphs
- maximum independent set
- maximum clique
- maximum cardinality
- dense subgraphs
- graph drawing
- average degree
- random walk
- structured data
- evolving graphs
- topological information
- planar graphs
- adjacency graph
- community discovery
- edge weights
- association graph
- maximal cliques
- relational graph
- social graphs
- real world graphs
- reachability queries
- spectral decomposition
- graph patterns
- graph embedding
- fully connected
- web graph
- pattern mining
- complex networks
- dominating set