On the complexity of recognizing a class of generalized networks

DOI10.1016/0167-6377(85)90036-7zbMath0565.90078OpenAlexW2087699002MaRDI QIDQ1058995

Vijaya Chandru, Collette R. Coullard, Donald K. Wagner

Publication date: 1985

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(85)90036-7

zbMATH Keywords

computational complexitymatroidgeneralized network flow problemproblem equivalenceproblem transformationunit-weight cycles

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Linear programming (90C05) Deterministic network models in operations research (90B10) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (4)

Recognizing a class of bicircular matroids ⋮ The structure of bases in bicircular matroids ⋮ Characterizing bias matroids ⋮ Uncovering generalized-network structure in matrices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on detecting simple redundancies in linear systems
• Connectivity in bicircular matroids
• An efficient PQ-graph algorithm for solving the graph-realization problem
• Voltage-Graphic Matroids
• Converting Linear Programs to Network Problems
• An efficient scaling procedure for gain networks

This page was built for publication: On the complexity of recognizing a class of generalized networks