The complexity of finding arborescences in hypergraphs

DOI10.1016/0020-0190(92)90057-3zbMATH Open0760.68039OpenAlexW2155171773MaRDI QIDQ1205723FDOQ1205723

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Finding optimum branchings
• A weighted matroid intersection algorithm

Cited In (2)

• Data optimizations for constraint automata
• Minimum spanning hypertrees

Recommendations

• Minimum spanning hypertrees 👍 👎
• Blocking optimal arborescences 👍 👎
• Packing algorithms for arborescences (and spanning trees) in capacitated graphs 👍 👎
• Title not available (Why is that?) 👍 👎

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)