✦ LIBER ✦

Vertex covers and eternal dominating sets

✍ Scribed by William F. Klostermeyer; C.M. Mynhardt

Book ID: 113564749
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 238 KB
Volume: 160
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2011.11.034

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Graphs with equal eternal vertex cover a

Graphs with equal eternal vertex cover and eternal domination numbers

✍ William F. Klostermeyer; C.M. Mynhardt 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 269 KB

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

Graph covers using t-colourable vertex s

Graph covers using t-colourable vertex sets

✍ Sylvain Gravier; Jeannette Janssen; Kyriakos Kilakos; Sulamita Klein 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 310 KB

Vertex Covers and Secure Domination in G

Vertex Covers and Secure Domination in Graphs

✍ Burger, Alewyn; Henning, Michael; van Vuuren, Jan 📂 Article 📅 2008 🏛 Taylor and Francis Group 🌐 English ⚖ 171 KB

Test Sets for Vertex Cover Problems

✍ M. Hayer; W. Hochstättler 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 93 KB

The Resolution Complexity of Independent

The Resolution Complexity of Independent Sets and Vertex Covers in Random Graphs

✍ Paul Beame; Russell Impagliazzo; Ashish Sabharwal 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 486 KB