๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Approximating Minimum Feedback Sets and Multicuts in Directed Graphs

โœ Scribed by G. Even; J. (Seffi) Naor; B. Schieber; M. Sudan


Publisher
Springer
Year
1998
Tongue
English
Weight
207 KB
Volume
20
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


On feedback vertex sets and nonseparatin
โœ Ewald Speckenmeyer ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 341 KB

Let G be an undirected connected graph with n nodes. A subset F of nodes of G is a feedback vertex set (fvs) if G -F is a forest and a subset J of nodes of G is a nonseparating independent set (nsis) if no two nodes of J are adjacent and G -J is connected. f(G), z ( G ) denote the cardinalities of a