Factorizing the Rado graph and infinite complete graphs.
Simone CostaTommaso TraettaPublished in: Ars Math. Contemp. (2023)
Keyphrases
- graph theory
- graph representation
- graph databases
- graph matching
- graph theoretic
- directed graph
- graph mining
- labeled graphs
- graph structures
- graph construction
- graph structure
- graph search
- weighted graph
- graph clustering
- series parallel
- graph classification
- adjacency matrix
- graph theoretical
- graph partitioning
- graph data
- graph properties
- structural pattern recognition
- random graphs
- undirected graph
- graph transformation
- graph model
- random walk
- graph isomorphism
- reachability queries
- spanning tree
- subgraph isomorphism
- dynamic graph
- minimum spanning tree
- bipartite graph
- graph kernels
- graph representations
- maximum clique
- dense subgraphs
- graph drawing
- attributed graphs
- graph patterns
- inexact graph matching
- connected graphs
- maximal cliques
- neighborhood graph
- graph layout
- connected dominating set
- structured data
- adjacency graph
- relational graph
- finding the shortest path
- directed acyclic
- small world
- frequent subgraphs
- graph embedding
- proximity graph
- community discovery
- spectral decomposition
- edge weights
- topological information
- average degree
- social graphs
- maximum common subgraph
- web graph
- maximum independent set
- connected components
- maximum cardinality
- massive graphs
- bounded treewidth
- disk resident
- association graph
- query graph
- real world graphs