On the Upper Bounds of Local Inverse Signed Edge Domination Numbers in Graphs.
Zhifang FengWensheng LiHuaming XingQiongyu MaPublished in: ICICA (1) (2012)
Keyphrases
- upper bound
- weighted graph
- lower bound
- undirected graph
- minimum spanning trees
- edge detection
- edge information
- upper and lower bounds
- graph matching
- lower and upper bounds
- tight bounds
- graph theory
- adjacency graph
- sample size
- edge detector
- directed graph
- worst case
- graph representation
- graph partitioning
- upper bounding
- graph theoretic
- efficiently computable
- spanning tree
- branch and bound algorithm
- branch and bound
- edge map
- graph databases
- graph structure
- edge weights
- random graphs
- error probability
- shortest path
- random walk
- linear programming