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 treesimplex methodmarked graphdiakoptic transitionmaximum-weight marking

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05) Linear programming (90C05) Applications of graph theory to circuits and networks (94C15)

This page was built for publication: Maximum-weight markings in marked graphs: Algorithms and interpretations based on the simplex method