Linear-Time Graph Programs for Unbounded-Degree Graphs.
Ziad Ismaili AlaouiDetlef PlumpPublished in: ICGT (2024)
Keyphrases
- random graphs
- graph representation
- graph theory
- graph structure
- directed graph
- graph databases
- weighted graph
- labeled graphs
- graph construction
- graph matching
- graph mining
- graph theoretic
- graph structures
- adjacency matrix
- degree distribution
- graph theoretical
- graph model
- graph search
- graph classification
- graph partitioning
- graph properties
- graph data
- series parallel
- graph clustering
- bipartite graph
- undirected graph
- subgraph isomorphism
- reachability queries
- graph isomorphism
- structural pattern recognition
- spanning tree
- dynamic graph
- inexact graph matching
- disk resident
- edge weights
- neighborhood graph
- directed acyclic
- evolving graphs
- maximum common subgraph
- planar graphs
- topological information
- graph transformation
- average degree
- random walk
- attributed graphs
- graph kernels
- graph drawing
- dense subgraphs
- finding the shortest path
- connected graphs
- connected dominating set
- real world graphs
- clustering coefficient
- maximal cliques
- small world
- minimum spanning tree
- social networks
- pattern mining
- link analysis
- maximum cardinality
- massive graphs
- graph patterns
- graph representations
- association graph
- proximity graph
- suffix tree
- web graph
- connected components
- social graphs
- structured data
- adjacency graph