𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Computing kernels in directed bichromatic graphs

✍ Scribed by Burghard von Karger; Rudolf Berghammer

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
481 KB
Volume
62
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Kernels in directed graphs: a poison gam
Kernels in directed graphs: a poison game
✍ P. Duchet; H. Meyniel πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 282 KB

We consider a two player game on a progressively and locally finite directed graph and we prove that the first player wins if and only if the graph has a local kernel. The result is sharp. From it, we derive a short proof of a general version of the Galeana-Sanchez & Neuman-Lara Theorem that give a

Recent problems and results about kernel
Recent problems and results about kernels in directed graphs
✍ C. Berge; P. Duchet πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 355 KB

In Section 1, we survey the existence theorems for a kernel; in Section 2, we discuss a new conjecture which could constitute a bridge between the kernel problems and the perfect graph conjecture. In fact, we believe that a graph is 'quasi-perfect' if and only if it is perfect. ## Proposition 1.1.

Hierarchical directed acyclic graph kern
Hierarchical directed acyclic graph kernel
✍ Jun Suzuki; Yutaka Sasaki; Eisaku Maeda πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 607 KB