𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The complexity of finding arborescences in hypergraphs

✍ Scribed by Gerhard J. Woeginger

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
306 KB
Volume
44
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the complexity of finding balanced on
On the complexity of finding balanced oneway cuts
✍ Uriel Feige; Orly Yahalom πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 88 KB

A bisection of an n-vertex graph is a partition of its vertices into two sets S and T , each of size n/2. The bisection cost is the number of edges connecting the two sets. In directed graphs, the cost is the number of arcs going from S to T . Finding a minimum cost bisection is NP-hard for both und

On the complexity of finding common appr
On the complexity of finding common approximate substrings
✍ Patricia A. Evans; Andrew D. Smith; H.Todd Wareham πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 323 KB

Problems associated with ΓΏnding strings that are within a speciΓΏed Hamming distance of a given set of strings occur in several disciplines. In this paper, we use techniques from parameterized complexity to assess non-polynomial time algorithmic options and complexity for the COMMON APPROXIMATE SUBST