𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Complexity results for equistable graphs and related classes

✍ Scribed by Martin Milanič; James Orlin; Gábor Rudolf

Publisher
Springer US
Year
2010
Tongue
English
Weight
458 KB
Volume
188
Category
Article
ISSN
0254-5330

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A class of threshold and domishold graph
A class of threshold and domishold graphs: equistable and equidominating graphs
✍ Charles Payan 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 484 KB

A thwahold grerph (rtzspativ4y domlshukf graph) is 01 graph for which the independent 881% (rapsctiwzly ths dominuting a&a) cctn bgr chnfuctsrixsd by the 0, l-aolutiona of a linaur ## kpallty (ass [ij and [S]), We define here the #rugher far which the mawlmal indapsndent eettr (rsopsctivsly tha m

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

Undecidability Results for Low Complexit
Undecidability Results for Low Complexity Time Classes
✍ Rod Downey; André Nies 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 165 KB

We prove that the theory of Exptime degrees with respect to polynomial time Turing and many-one reducibility is undecidable. To do so we use a coding method based on ideal lattices of Boolean algebras which was introduced by Nies (1997, Bull. London Math. Soc. 29, 683 692). The method can be applied

New Lowness Results for ZPPNP and Other
New Lowness Results for ZPPNP and Other Complexity Classes
✍ V. Arvind; Johannes Köbler 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 242 KB

We show that the class AM \ coAM is low for ZPP NP . As a consequence, it follows that Graph Isomorphism and several group-theoretic problems are low for ZPP NP . We also show that the class IP½P=poly, consisting of sets that have interactive proof systems with honest provers in P=poly, is also low