The complexity of finding arborescences in hypergraphs

DOI10.1016/0020-0190(92)90057-3MaRDI QIDQ1205723zbMATH OpenOpenAlexFDO

Authors Gerhard J. Woeginger

Publication date 1 April 1993

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

Full work available at URL https://doi.org/10.1016/0020-0190(92)90057-3

zbMATH Keywords

arborescence subhypergraph problem

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 7692724
• Minimum spanning hypertrees
• Packing algorithms for arborescences (and spanning trees) in capacitated graphs

Cites work

• scientific article; zbMATH DE number 3534506 (Why is no real title available?)
• scientific article; zbMATH DE number 3558962 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A weighted matroid intersection algorithm
• Finding optimum branchings

Cited in

(2)

• Data optimizations for constraint automata
• Minimum spanning hypertrees

This page was built for publication: The complexity of finding arborescences in hypergraphs

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