𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Tight bounds for the probability of overfitting

✍ Scribed by K. V. Vorontsov


Book ID
111454966
Publisher
SP MAIK Nauka/Interperiodica
Year
2009
Tongue
English
Weight
183 KB
Volume
80
Category
Article
ISSN
1064-5624

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Tight Bounds for the Maximum Acyclic Sub
✍ Bonnie Berger; Peter W Shor πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 209 KB

Given a directed graph G s V, A , the maximum acyclic subgraph problem is to Ž . find a maximum cardinality subset AЈ of the arcs such that GЈ s V, AЈ is acyclic. In this paper, we present polynomial-time and RNC algorithms which, when given Ž any graph G without two-cycles, find an acyclic subgraph