Graph classes equivalent to 12-representable graphs.
Asahi TakaokaPublished in: Discuss. Math. Graph Theory (2024)
Keyphrases
- graph theory
- graph representation
- graph structure
- graph mining
- graph matching
- graph theoretic
- directed graph
- labeled graphs
- graph clustering
- graph construction
- graph theoretical
- bounded degree
- graph structures
- adjacency matrix
- weighted graph
- graph model
- graph databases
- graph properties
- directed acyclic
- graph partitioning
- subgraph isomorphism
- graph data
- equivalence class
- bipartite graph
- strongly connected
- series parallel
- graph classification
- equivalence classes
- random graphs
- connected graphs
- graph search
- undirected graph
- spanning tree
- minimum spanning tree
- reachability queries
- graph transformation
- real world graphs
- dense subgraphs
- structural pattern recognition
- maximum common subgraph
- random walk
- graph representations
- graph patterns
- inexact graph matching
- evolving graphs
- maximal cliques
- maximum independent set
- topological information
- edge weights
- neighborhood graph
- graph kernels
- markov equivalence classes
- structured data
- massive graphs
- graph layout
- dynamic graph
- adjacency graph
- association graph
- query graph
- maximum clique
- planar graphs
- hyper graph
- connected components
- graph drawing
- graph isomorphism
- connected dominating set
- disk resident
- directed acyclic graph
- finding the shortest path
- average degree
- proximity graph
- attributed graphs
- graphical models