Note on strict-double-bound numbers of nearly complete graphs missing some edges.
Kenjiro OgawaRyoko SoejimaSatoshi TagusariMorimasa TsuchiyaPublished in: Discret. Math. (2012)
Keyphrases
- directed graph
- weighted graph
- undirected graph
- spanning tree
- upper bound
- worst case
- missing data
- edge information
- directed edges
- edge weights
- graph theoretic
- bipartite graph
- real world graphs
- spectral embedding
- minimum cost
- data sets
- graph databases
- graph model
- graph theory
- complex structures
- graph matching
- image edges
- edge direction
- neural network