A linear algorithm to determine minimal spanning forests in chain graphs

DOI10.1016/0020-0190(82)90074-6MaRDI QIDQ1166934zbMATH OpenOpenAlexFDO

Authors Fabrizio Luccio, L. 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

algorithm designB- matchingcoverminimal spanning treeweighted graph

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3558962 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Minimum Covers of Fixed Cardinality in Weighted Graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1166934)