✦ LIBER ✦

Enumerating the kernels of a directed graph with no odd circuits

✍ Scribed by Jayme L. Szwarcfiter; Guy Chaty

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 473 KB
Volume: 51
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(94)00072-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Covering the edge set of a directed grap

Covering the edge set of a directed graph with trees

✍ K. Vidyasankar 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 580 KB

The maximum number of q-cliques in a gra

The maximum number of q-cliques in a graph with no p-clique

✍ Steven Roman 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 805 KB

ChemInform Abstract: Algorithm for the D

ChemInform Abstract: Algorithm for the Direct Enumeration of Chiral and Achiral Skeletons of a Homosubstituted Derivative of a Monocyclic Cycloalkane with a Large and Factorizable Ring Size n.

✍ Robert M. Nemba; Alexandru T. Balaban 📂 Article 📅 2010 🏛 John Wiley and Sons ⚖ 25 KB 👁 1 views

IEEE trans. on circuit theory: Alekseyev

IEEE trans. on circuit theory: Alekseyev, O. V. ‘Design of distributed amplifiers with the aid of a computer’ Vol CR-20, No 6 (November 1973) pp 702–703

📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 129 KB

A computer progran\* is described for designing continuous post-tensioned concrete flat plates, slabs, beams and girders with or without cantilevers and subject to vertical loads. The program is written for prismatic members of various shapes including both T anti I sections and the paper includes a