On the width-length inequality

DOI10.1007/BF01582111zbMATH Open0396.94024OpenAlexW2093245331MaRDI QIDQ4180280FDOQ4180280

Authors: 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)

Cites Work

• Title not available (Why is that?)
• Reliable circuits using less reliable relays
• The extremal length of a network

Cited In (15)

• Testing idealness in the filter oracle model
• Polyhedral Combinatorics in Combinatorial Optimization
• Idealness of \(k\)-wise intersecting families
• Clean tangled clutters, simplices, and projective geometries
• On Packing Dijoins in Digraphs and Weighted Digraphs
• Vertex adjacencies in the set covering polyhedron
• A new infinite family of minimally nonideal matrices
• Energy of convex sets, shortest paths, and resistance
• Idealness of \(k\)-wise intersecting families
• Matroids and multicommodity flows
• Clean clutters and dyadic fractional packings
• On dyadic fractional packings of \(T\)-joins
• On ideal semicomplete digraphs
• Enumerating minimal transversals of hypergraphs without small holes
• Colouring non-even digraphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4180280)