Bounds on Half Graph Orders in Powers of Sparse Graphs.
Marek SokolowskiPublished in: Electron. J. Comb. (2023)
Keyphrases
- directed acyclic
- graph representation
- gaussian graphical models
- graph theory
- graph structure
- directed graph
- weighted graph
- graph matching
- graph construction
- graph databases
- labeled graphs
- graph theoretic
- random graphs
- graph mining
- graph model
- graph structures
- graph classification
- graph clustering
- adjacency matrix
- graph theoretical
- graph partitioning
- graph properties
- graph data
- series parallel
- densely connected
- subgraph isomorphism
- undirected graph
- graph transformation
- structural pattern recognition
- graph search
- bipartite graph
- connected graphs
- graph isomorphism
- upper bound
- dynamic graph
- edge weights
- graph representations
- topological information
- planar graphs
- evolving graphs
- reachability queries
- spanning tree
- maximum clique
- attributed graphs
- finding the shortest path
- graph drawing
- minimum spanning tree
- web graph
- real world graphs
- adjacency graph
- connected dominating set
- graph kernels
- inexact graph matching
- graph patterns
- graph layout
- graph embedding
- neighborhood graph
- connected components
- random walk
- bounded treewidth
- community discovery
- dense subgraphs
- lower bound
- small world
- graphical models
- social graphs
- massive graphs
- maximum cardinality
- link prediction
- sparse representation
- attributed relational graph
- high dimensional