Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

On the width-length inequality

From MaRDI portal
Publication:4180280
Jump to:navigation, search

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

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
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4180280&oldid=18011357"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 6 February 2024, at 13:11.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki