𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Fast algorithms for finding Hamiltonian paths and cycles in in-tournament digraphs

✍ Scribed by Jørgen Bang-Jensen; Pavol Hell

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
332 KB
Volume
41
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Hamiltonian cycles and paths in Cayley g
Hamiltonian cycles and paths in Cayley graphs and digraphs — A survey
✍ Stephen J. Curran; Joseph A. Gallian 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 927 KB

Cayley graphs arise naturally in computer science, in the study of word-hyperbolic groups and automatic groups, in change-ringing, in creating Escher-like repeating patterns in the hyperbolic plane, and in combinatorial designs. Moreover, Babai has shown that all graphs can be realized as an induced

Tools for studying paths and cycles in d
Tools for studying paths and cycles in digraphs
✍ Delorme, C.; Ordaz, O.; Quiroz, D. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 251 KB

The main goal of this work was to describe the basic elements constituting a specialized knowledge base in the field of paths and circuits in digraphs. This knowledge base contains commented on examples with textual and graphical descriptions, invariants, relations among invariants, and theorems. It