Three Equivalent Partial Orders on Graphs with Real Edge-Weights Drawn on a Convex Polygon
Three partial orders, cut-size order, length order, and operation order, defined between labeled multigraphs with the same order are known to be equivalent. This paper extends the result on edge-capacitated graphs, where the capacities are real numbers, and it presents a proof of the equivalence of the three relations. From this proof, it is also shown that we can determine whether or not a given graph precedes another given graph in polynomial time.
Unable to display preview. Download preview PDF.