On the width-length inequality

DOI10.1007/BF01582111zbMath0396.94024OpenAlexW2093245331MaRDI QIDQ4180280

Alfred Lehman

Publication date: 1979

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01582111

zbMATH Keywords

GraphCutResistor NetworkWidth-Length Inequality

Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15)

Related Items (15)

Idealness of k-wise Intersecting Families ⋮ On Dyadic Fractional Packings of $T$-Joins ⋮ Clean Clutters and Dyadic Fractional Packings ⋮ Clean tangled clutters, simplices, and projective geometries ⋮ Polyhedral Combinatorics in Combinatorial Optimization ⋮ A new infinite family of minimally nonideal matrices ⋮ On Packing Dijoins in Digraphs and Weighted Digraphs ⋮ Matroids and multicommodity flows ⋮ Enumerating Minimal Transversals of Hypergraphs without Small Holes ⋮ Energy of convex sets, shortest paths, and resistance ⋮ Vertex adjacencies in the set covering polyhedron ⋮ On ideal semicomplete digraphs ⋮ Colouring non-even digraphs ⋮ Testing idealness in the filter oracle model ⋮ Idealness of \(k\)-wise intersecting families

Cites Work

• Unnamed Item
• The extremal length of a network
• Reliable circuits using less reliable relays

This page was built for publication: On the width-length inequality