Hamiltonicity of graphs perturbed by a random regular graph.
Alberto Espuny DíazAntónio GirãoPublished in: Random Struct. Algorithms (2023)
Keyphrases
- graph theory
- graph representation
- graph structure
- graph matching
- weighted graph
- graph theoretic
- directed graph
- labeled graphs
- graph databases
- graph mining
- graph construction
- graph theoretical
- adjacency matrix
- graph clustering
- random graphs
- graph structures
- graph classification
- series parallel
- graph search
- graph properties
- graph partitioning
- structural pattern recognition
- graph data
- graph model
- subgraph isomorphism
- graph transformation
- dynamic graph
- graph kernels
- graph isomorphism
- evolving graphs
- connected graphs
- spanning tree
- bipartite graph
- minimum spanning tree
- undirected graph
- graph representations
- social graphs
- average degree
- reachability queries
- finding the shortest path
- connected dominating set
- graph patterns
- planar graphs
- directed acyclic
- maximum clique
- pattern mining
- attributed graphs
- disk resident
- graph embedding
- inexact graph matching
- maximum cardinality
- massive graphs
- dense subgraphs
- real world graphs
- maximum independent set
- neighborhood graph
- adjacency graph
- maximal cliques
- query graph
- web graph
- maximum common subgraph
- small world
- structured data
- random walk
- community detection
- bounded degree
- edge weights
- frequent subgraphs
- bounded treewidth
- vertex set
- strongly connected