Polynomial Algorithms for Some Hard Problems of Finding Connected Spanning Subgraphs of Extreme Total Edge Weight

DOI10.1007/978-3-540-69995-8_36zbMath1209.90333MaRDI QIDQ5391765

E. Kh. Gimadi, Alexei E. Baburin

Publication date: 7 April 2011

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

Full work available at URL: https://doi.org/10.1007/978-3-540-69995-8_36

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks