Sharp bounds for the Chinese Postman Problem in 3-regular graphs and multigraphs.
Suil ODouglas B. WestPublished in: Discret. Appl. Math. (2015)
Keyphrases
- upper bound
- directed graph
- high quality
- lower bound
- communication networks
- upper and lower bounds
- error bounds
- tight bounds
- graph matching
- graph theoretic
- spanning tree
- lower and upper bounds
- structured objects
- learning algorithm
- average case
- graph partitioning
- graph mining
- weighted graph
- graph structure
- special case
- pairwise