The Complexity of Subtree Intersection Representation of Chordal Graphs and Linear Time Chordal Graph Generation.
Tínaz EkimMordechai ShalomOylum SekerPublished in: CoRR (2019)
Keyphrases
- undirected graph
- graph representation
- graph structures
- graph structure
- directed graph
- worst case
- spectral decomposition
- graph matching
- graph model
- graph theory
- approximation algorithms
- spanning tree
- polynomial time complexity
- graph representations
- graph partitioning
- graph databases
- adjacency matrix
- graph construction
- graph theoretic
- weighted graph
- graph mining
- graph search
- graph isomorphism
- connected components
- random graphs
- topological information
- labeled graphs
- structural pattern recognition
- perfect phylogeny
- graph clustering
- directed acyclic graph
- bipartite graph
- graph classification
- complex networks
- np complete
- series parallel
- graph kernels
- path consistency
- attributed graphs
- graphical representation
- graph theoretical
- bounded treewidth
- subgraph isomorphism
- random walk
- graph data
- neighborhood graph
- dynamic graph
- directed acyclic
- graphical models
- vertex set
- web graph
- planar graphs
- maximal cliques
- edge weights
- minimum spanning tree
- relational structures