The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation.
Tínaz EkimMordechai ShalomOylum SekerPublished in: J. Comb. Optim. (2021)
Keyphrases
- undirected graph
- graph representation
- graph structures
- graph structure
- worst case
- spectral decomposition
- directed graph
- graph theory
- graph model
- graph matching
- graph mining
- spanning tree
- weighted graph
- graph theoretic
- graph databases
- approximation algorithms
- directed acyclic graph
- graph representations
- subgraph isomorphism
- graph clustering
- random graphs
- structural pattern recognition
- labeled graphs
- graph data
- bipartite graph
- graph construction
- graph theoretical
- graph classification
- graph partitioning
- graph isomorphism
- representational power
- polynomial time complexity
- complex networks
- vertex set
- topological information
- evolving graphs
- minimum spanning tree
- community discovery
- adjacency matrix
- graph search
- neighborhood graph
- graphical representation
- connected components
- structured data
- series parallel
- frequent subgraphs
- edge weights
- minimum cost
- tree structure
- reachability queries
- directed acyclic
- random walk