✦ LIBER ✦

The combinatorics of splittability

✍ Scribed by Boaz Tsaban

Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 366 KB
Volume: 129
Category: Article
ISSN: 0168-0072
DOI: 10.1016/j.apal.2003.03.001

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Splittability over Semigroups

✍ A.J. Hanna; T.B.M. McMaster 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 303 KB

Totally Splittable Polytopes

✍ Sven Herrmann; Michael Joswig 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 467 KB

The k-Splittable Flow Problem

✍ Georg Baier; Ekkehard Köhler; Martin Skutella 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 270 KB

The combinatorics of timetabling

✍ D. de Werra 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 714 KB

Various formulations of timetabling problems are given in terms of coloring problems in graphs. We consider a collection of simple class-teacher timetabling problems and review complexity issues for these formulations. This tutorial presentation (which is not claimed to be an exhaustive review nor a

Maximumk-Splittables,t-Flows

✍ Ronald Koch; Martin Skutella; Ines Spenke 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 295 KB

Completely Splittable Representations of

Completely Splittable Representations of Symmetric Groups

✍ Alexander Kleshchev 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 147 KB