An asymptotic upper bound for graph embeddings.
Evangelos BartzosIoannis Z. EmirisCharalambos TzamosPublished in: Discret. Appl. Math. (2023)
Keyphrases
- upper bound
- worst case
- lower bound
- closed form expressions
- branch and bound algorithm
- weighted graph
- branch and bound
- directed acyclic graph
- graph structures
- graph representation
- directed graph
- graph matching
- graph model
- special case
- graph theoretic
- generalization error
- graph structure
- graph theory
- bipartite graph
- connected components
- structured data
- random walk
- dimensionality reduction
- spanning tree
- graph partitioning
- lower and upper bounds
- graph clustering
- graph construction
- large deviations
- graph based algorithm
- error probability