✦ LIBER ✦

Graph theoretic relaxations of set covering and set partitioning problems

✍ Scribed by Elia El-Darzi; Gautam Mitra

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 786 KB
Volume: 87
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(94)00115-s

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Partitions of graphs into one or two ind

Partitions of graphs into one or two independent sets and cliques

✍ Andreas Brandstädt 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 417 KB

It is shown in this note that it can be recognized in polynomial time whether the vertex set of a finite undirected graph can be partitioned into one or two independent sets and one or two cliques. Such graphs generalize bipartite and split graphs and the result also shows that it can be recognized

Blocking Systems of a Graph and ∪ ∩ Inte

Blocking Systems of a Graph and ∪ ∩ Interchange Equality in Bottleneck Problems Involving Sets and Fuzzy Sets

✍ Kenji Onaga; Shu Park Chan 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 661 KB

A blocking system (9, 2Q of a finite set E of objects is two families of non-comparable subsets of E satisfying the non-empty intersection property and the sample set inclusion property. This paper presents nine new examples, and proves 17 U -interchange equality. As applications, bottleneck problem

The stable set problem and the thinness

The stable set problem and the thinness of a graph

✍ Carlo Mannino; Gianpaolo Oriolo; Federico Ricci; Sunil Chandran 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 207 KB

Exact solution of crew scheduling proble

Exact solution of crew scheduling problems using the set partitioning model: Recent successful applications

✍ Roy E. Marsten; Fred Shepardson 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 736 KB

Model of twelve properties of a set of o

Model of twelve properties of a set of organic solvents with graph-theoretical and/or experimental parameters

✍ Lionello Pogliani 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 180 KB

## Abstract Twelve properties of a highly heterogeneous class of organic solvents have been modeled with a graph‐theoretical molecular connectivity modified (MC) method, which allows to encode the core electrons and the hydrogen atoms. The graph‐theoretical method uses the concepts of simple, gener