Towers and Cycle Covers for Max-Balanced Graphs

  title={Towers and Cycle Covers for Max-Balanced Graphs},
  author={Hans Schneider},
Let G = (V,A,g) be a strongly connected weighted graph. We say that G is max-balanced if for every cut W, the maximum weight over arcs leaving W equals the maximum weight over arcs entering W. A subgraph H of G is max-sufficient if (or every cut W, the maximum weight over a.rcs of G leaving W is attained at some arc of H. A tower T = (CI,C., ... ,C,) is a sequence of arc-sets of G where C'+ I is a cycle all of whose weights are maximal in the graph formed by contracting the sets CI , C… CONTINUE READING
6 Citations
8 References
Similar Papers


Publications referenced by this paper.
Showing 1-8 of 8 references

Characterizations of Max-Balanced Graphs

  • Uriel G. Rothblum, Hans Schneider, Micha.el H. Schneider
  • OR Group Report Series #89-7,
  • 1989
1 Excerpt

Matrix scaling, entropy minimization, and conjugate duality (I): Positivity conditions

  • Michael H. Schneider
  • Linear Algebra and Its Applications,
  • 1989

Max-balancing weighted directed graphs. OR Group Report Series #89-5

  • Hans Schneider, Michael H. Schneider
  • To appear in Mathematics of Operations Research
  • 1989
2 Excerpts

Schneider . Matrix scaling , entropy minimization , and conjugate duality ( II ) : The dual problem

  • H Iichael
  • 1989

An I-co balancing of a weighted directed graph

  • OR Group Report Series #88-1,
  • 1987
2 Excerpts

Schneider . Max - balancing weighted directed graphs

  • Hans Schneider
  • 1987

HofIma . n , Uriel G . Rothblum , and IIans Schneider . Line - sum - symmetric scalings of square nonnegative matrices

  • Curtis Eaves, J. Alan
  • lHathematical Programming Studies

Similar Papers

Loading similar papers…