✦ LIBER ✦

Hierarchical directed acyclic graph kernel

✍ Scribed by Jun Suzuki; Yutaka Sasaki; Eisaku Maeda

Publisher: John Wiley and Sons
Year: 2006
Tongue: English
Weight: 607 KB
Volume: 37
Category: Article
ISSN: 0882-1666
DOI: 10.1002/scj.20485

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Transforming a cyclic directed graph int

Transforming a cyclic directed graph into an acyclic graph

✍ V. V. Filippovich 📂 Article 📅 1975 🏛 Springer US 🌐 English ⚖ 238 KB

Computing kernels in directed bichromati

Computing kernels in directed bichromatic graphs

✍ Burghard von Karger; Rudolf Berghammer 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 481 KB

A phase transition phenomenon in a rando

A phase transition phenomenon in a random directed acyclic graph

✍ B. Pittel; R. Tungol 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 158 KB

Let a random directed acyclic graph be defined as being obtained from the random graph G n p by orienting the edges according to the ordering of vertices. Let γ \* n be the size of the largest (reflexive, transitive) closure of a vertex. For p = c log n /n, we prove that, with high probability, γ \*

Cost-minimal trees in directed acyclic g

Cost-minimal trees in directed acyclic graphs

✍ L. Nastansky; S. M. Selkow; N. F. Stewart 📂 Article 📅 1974 🏛 Springer 🌐 English ⚖ 519 KB

Efficient coding of labeled directed acy

Efficient coding of labeled directed acyclic graphs

✍ B. Steinsky 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 131 KB

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