Extremal Length and Width of Blocking Polyhedra, Kirchhoff Spaces and Multiport Networks

DOI10.1137/0608052zbMath0649.90088OpenAlexW2076946982MaRDI QIDQ3795495

Seth Chaiken

Publication date: 1987

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0608052

zbMATH Keywords

extremal lengthpolyhedral combinatoricsextremal widthblocking pairs of polyhedraone-port networkKirchhoff spacelength-width inequalitymultiport case

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polytopes and polyhedra (52Bxx)

Related Items (2)

Delta Minors, Delta Free Clutters, and Entanglement ⋮ Lyapunov spectrum determination from the FEM simulation of a chaotic advecting flow

Cites Work

• The extremal length of a network
• Matrix Operations Induced by Network Connections
• On the width—length inequality
• Reliable circuits using less reliable relays
• On the Algebra of Networks
• Theory of Matroids
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Extremal Length and Width of Blocking Polyhedra, Kirchhoff Spaces and Multiport Networks