✦ LIBER ✦

An algorithmic characterization of total digraphs

✍ Scribed by Mirosława Skowrońska; Maciej M Sysło; Cristina Zamfirescu

Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 764 KB
Volume: 7
Category: Article
ISSN: 0196-6774
DOI: 10.1016/0196-6774(86)90041-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithmic characterization of antim

An algorithmic characterization of antimatroids

✍ E.Andrew Boyd; Ulrich Faigle 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 626 KB

An algorithm for optimum common root fun

An algorithm for optimum common root functions of two digraphs

✍ Mao-cheng Cai 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 427 KB

An algorithm for optimum common root functions of two digraphs, Discrete -i? Mathematics 119 (1993) 13-20. ,%I, Let G1 and G, be finite digr,phs, both with vertex set V. Suppose that each c of V has nonnegative integers f(a) and g(u) with,'f(o)<g( ). v and each arc e of G, has nonnegative integers a

A characterization of Thompson digraphs

✍ Dora Giammarresi; Jean-Luc Ponty; Derick Wood; Djelloul Ziadi 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 398 KB

A ÿnite-state machine is called a Thompson machine if it can be constructed from an emptyfree regular expression using the construction of Thompson as modiÿed by Hopcroft and Ullman. We call the underlying digraph of a Thompson machine a Thompson digraph. We characterize Thompson digraphs and we giv

An optimal algorithm for the period of a

An optimal algorithm for the period of a strongly connected digraph

✍ Adriano Pascoletti 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 393 KB

Characterizations of two classes of digr

Characterizations of two classes of digraphs

✍ Zygmunt Jackowski 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 796 KB

In the paper we present two characterizations of classes of digraphs. The first is a forbidden triple characterization of digraphs with augmented adjacency matrices having consecutive ones property for columns. The second is a forbidden circuit characterization of digraphs with totally balanced augm

A characterization of interval catch dig

A characterization of interval catch digraphs

✍ Erich Prisner 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 442 KB

It is shown that a (finite or infinite) digraph D is the catch digraph of a family of pointed intervals if and only if it contains no set of three vertices which Wail: any two of them are weakly connected by a chain where no initial endpoint of an arc precedes the third vertex. Furthermore, it is s