The complexity of finding arborescences in hypergraphs
References (6)
A weighted matroid intersection algorithm
J. Algorithms
(1981)- et al.
Computers and Intractability: A Guide to the Theory of NP-Completeness
(1979) Learnability of production constrained probabilities
(1992)
There are more references available in the full text version of this article.
Cited by (2)
Data optimizations for constraint automata
2016, Logical Methods in Computer ScienceTake command of your constraints!
2015, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
- ∗
This research was partially supported by the Christian Doppler Laboratorium für Diskrete Optimierung.
Copyright © 1992 Published by Elsevier B.V.