Breaking Symmetry in Complete Graphs by Orienting Edges: Asymptotic Bounds.
Frank HararyDesh RanjanPublished in: Inf. Process. Lett. (1998)
Keyphrases
- directed graph
- weighted graph
- worst case
- rates of convergence
- upper bound
- large deviations
- spanning tree
- undirected graph
- edge weights
- asymptotically optimal
- asymptotic optimality
- graph structure
- closed form expressions
- finite sample
- symmetry detection
- real world graphs
- spectral embedding
- graph representation
- edge information
- graph theory
- bipartite graph
- error bounds
- expected values
- upper and lower bounds
- lower and upper bounds
- lower bound
- graph clustering
- directed acyclic graph
- graph matching
- edge detector
- shortest path
- worst case bounds