𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Complexity results for identifying codes in planar graphs

✍ Scribed by David Auger; Irène Charon; Olivier Hudry; Antoine Lobstein

Book ID
111206025
Publisher
John Wiley and Sons
Year
2010
Tongue
English
Weight
514 KB
Volume
17
Category
Article
ISSN
0969-6016

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Identifying Codes in Line Graphs
Identifying Codes in Line Graphs
✍ Florent Foucaud; Sylvain Gravier; Reza Naserasr; Aline Parreau; Petru Valicov 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 811 KB
Complexity results for well-covered grap
Complexity results for well-covered graphs
✍ Ramesh S. Sankaranarayana; Lorna K. Stewart 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 740 KB

## Abstract A graph with __n__ vertices is well covered if every maximal independent set is a maximum independent set and very well covered if every maximal independent set has size __n__/2. In this work, we study these graphs from an algorithmic complexity point of view. We show that well‐covered