Sharp threshold for embedding balanced spanning trees in random geometric graphs.
Alberto Espuny DíazLyuben LichevDieter MitscheAlexandra WesolekPublished in: CoRR (2023)
Keyphrases
- spanning tree
- minimum spanning tree
- minimum spanning trees
- edge disjoint
- minimum cost
- undirected graph
- weighted graph
- minimum weight
- heat kernel
- depth first search
- edge weights
- minimum total cost
- graph theoretical
- geometric structure
- upper bound
- root node
- np hard
- data structure
- social networks
- graph embedding
- data hiding
- bayesian networks