𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On Finding Critical Independent and Vertex Sets

✍ Scribed by Ageev, Alexander A.

Book ID
118197239
Publisher
Society for Industrial and Applied Mathematics
Year
1994
Tongue
English
Weight
237 KB
Volume
7
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On locally optimal independent sets and
On locally optimal independent sets and vertex covers
✍ Gang Yu; Olivier Goldschmidt πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 665 KB

In this paper, we introduce a new notion of local optimality and demonstrate its application to the problem of finding optimal independent sets and vertex covers in k-claw free graphs. The maximum independent set problem in k-claw free graphs has interesting applications in the design of electronic

On Independent Vertex Sets in Subclasses
On Independent Vertex Sets in Subclasses of
✍ Andreas BrandstΓ€dt; Tilo Klembt; Vadim V. Lozin; Raffaele Mosca πŸ“‚ Article πŸ“… 2008 πŸ› Springer 🌐 English βš– 344 KB
On feedback vertex sets and nonseparatin
On feedback vertex sets and nonseparating independent sets in cubic graphs
✍ 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

On Parameterized Independent Feedback Ve
On Parameterized Independent Feedback Vertex Set
✍ Misra, Neeldhara; Philip, Geevarghese; Raman, Venkatesh; Saurabh, Saket πŸ“‚ Article πŸ“… 2012 πŸ› Elsevier Science 🌐 English βš– 355 KB