Powers of Hamilton cycles in dense graphs perturbed by a random geometric graph.
Alberto Espuny DíazJoseph HydePublished in: Eur. J. Comb. (2024)
Keyphrases
- graph theoretical
- quasi cliques
- graph theory
- graph representation
- graph structure
- weighted graph
- directed graph
- graph construction
- topological information
- graph matching
- graph structures
- graph model
- densely connected
- labeled graphs
- graph databases
- graph properties
- graph classification
- graph mining
- graph theoretic
- adjacency matrix
- graph clustering
- series parallel
- graph data
- graph transformation
- subgraph isomorphism
- graph search
- graph partitioning
- graph kernels
- structural pattern recognition
- bipartite graph
- spanning tree
- community discovery
- random walk
- random graphs
- disk resident
- graph isomorphism
- evolving graphs
- reachability queries
- query graph
- graph drawing
- dense subgraphs
- graph patterns
- inexact graph matching
- finding the shortest path
- directed acyclic
- maximal cliques
- maximum cardinality
- polynomial time complexity
- adjacency graph
- attributed graphs
- minimum spanning tree
- graph layout
- dynamic graph
- proximity graph
- social networks
- maximum common subgraph
- graph representations
- graph embedding
- neighborhood graph
- shortest path
- maximum clique
- degree distribution
- planar graphs
- relational structures
- edge weights
- web graph
- undirected graph
- community structure
- structured data
- np complete