Maximum-weight markings in marked graphs: Algorithms and interpretations based on the simplex method

DOI10.1109/TCS.1987.1086091zbMath0677.90081MaRDI QIDQ3833891

M. C. Comeau, Krishnaiyan Thulasiraman

Publication date: 1987

Published in: IEEE Transactions on Circuits and Systems (Search for Journal in Brave)

zbMATH Keywords

spanning tree; simplex method; marked graph; diakoptic transition; maximum-weight marking

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

05C05: Trees

90C05: Linear programming

94C15: Applications of graph theory to circuits and networks