Tree-layout based graph classes: proper chordal graphs.
Christophe PaulEvangelos ProtopapasPublished in: CoRR (2022)
Keyphrases
- bounded degree
- graph layout
- undirected graph
- graph structure
- spanning tree
- minimum spanning tree
- graph theoretic
- graph theory
- weighted graph
- reachability queries
- directed graph
- maximal cliques
- graph representation
- adjacency matrix
- graph structures
- graph construction
- graph matching
- graph databases
- labeled graphs
- graph mining
- graph clustering
- directed acyclic
- tree structure
- graph model
- maximum weight
- bipartite graph
- graph properties
- random walk
- constraint graph
- graph classification
- graph representations
- series parallel
- graph theoretical
- random graphs
- graph search
- graph partitioning
- evolving graphs
- connected components
- minimum cost
- maximum clique
- maximum common subgraph
- dynamic graph
- tree shaped
- web graph
- edge weights
- equivalence classes
- subgraph isomorphism
- bounded treewidth
- approximation algorithms
- attributed graphs
- structural pattern recognition
- tree nodes
- finding the shortest path
- perfect phylogeny
- attributed relational graph
- graph patterns
- graph data
- graph isomorphism
- densely connected
- tree search
- complex structures
- pattern mining
- missing data
- np complete