The complexity of finding arborescences in hypergraphs

DOI10.1016/0020-0190(92)90057-3zbMath0760.68039OpenAlexW2155171773MaRDI QIDQ1205723

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) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10)

Related Items

Data optimizations for constraint automata

Cites Work

• A weighted matroid intersection algorithm
• Finding optimum branchings
• Unnamed Item
• Unnamed Item
• Unnamed Item