Nowhere-zero 3-flows of graphs with prescribed sizes of odd edge cuts.
Rong LuoZhengke MiaoRui XuCun-Quan ZhangPublished in: Eur. J. Comb. (2014)
Keyphrases
- weighted graph
- undirected graph
- adjacency graph
- minimum spanning trees
- edge detection
- edge information
- graph theoretic
- spanning tree
- data sets
- graph matching
- directed graph
- edge weights
- graph structure
- image processing
- bipartite graph
- approximation algorithms
- directed acyclic graph
- graph partitioning
- graph representation
- shortest path
- multiple scales
- random graphs
- series parallel
- d objects