Hitting Time of Edge Disjoint Hamilton Cycles in Random Subgraph Processes on Dense Base Graphs.

Yahav Alon Michael Krivelevich

Published in: SIAM J. Discret. Math. (2022)

Keyphrases

edge disjoint
spanning tree
graph mining
graph databases
subgraph isomorphism
quasi cliques
graph classification
subgraph matching

graph properties
graph data
edge weights
total length
labeled graphs
graph theory
query graph

markov chain
graph matching
dense subgraphs
frequent subgraph mining
graph theoretic
minimum cost
graph kernels

undirected graph
weighted graph
maximum clique
bayesian networks
graph partitioning
connected subgraphs
directed graph