A linear algorithm to determine minimal spanning forests in chain graphs

DOI10.1016/0020-0190(82)90074-6zbMath0489.68059OpenAlexW1977720008MaRDI QIDQ1166934

Fabrizio Luccio, Linda Pagli

Publication date: 1982

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(82)90074-6

zbMATH Keywords

weighted graphcoverminimal spanning treealgorithm designB- matching

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Minimum Covers of Fixed Cardinality in Weighted Graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: A linear algorithm to determine minimal spanning forests in chain graphs