✦ LIBER ✦

Set graphs. II. Complexity of set graph recognition and similar problems

✍ Scribed by Milanič, Martin; Rizzi, Romeo; Tomescu, Alexandru I.

Book ID: 125825393
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 407 KB
Volume: 547
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2014.06.017

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Graph theoretic relaxations of set cover

Graph theoretic relaxations of set covering and set partitioning problems

✍ Elia El-Darzi; Gautam Mitra 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 786 KB

Parameterized dominating set problem in

Parameterized dominating set problem in chordal graphs: complexity and lower bound

✍ Chunmei Liu; Yinglei Song 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 305 KB

Schedules on graphs and independent sets

Schedules on graphs and independent sets of graphs

✍ A. I. Kuksa 📂 Article 📅 1973 🏛 Springer US 🌐 English ⚖ 338 KB

Characterization problems for graphs, pa

Characterization problems for graphs, partially ordered sets, lattices, and families of sets

✍ William T. Trotter Jr.; John I. Moore Jr. 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 909 KB

A standard problem in combinatorial theory is to characterize structures which satisfy a certain property by providing a minimum list of forbidden substructures, for example, Kuratowski's well known characterization of planar graphs. In this paper, we establish connections between characterization p

Characterization and recognition of Rado

Characterization and recognition of Radon-independent sets in split graphs

✍ Dourado, Mitre C.; Rautenbach, Dieter; dos Santos, Vinícius Fernandes; Szwarcfit 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 191 KB

Molecular Similarity. 1. Analytical Desc

✍ Skvortsova, M.I.; Baskin, I.I.; Stankevich, I.V.; Palyulin, V.A.; Zefirov, N.S. 📂 Article 📅 1998 🏛 American Chemical Society 🌐 English ⚖ 61 KB