✦ LIBER ✦

Search for all self-avoiding paths for molecular graphs

✍ Scribed by Milan Randić; Gregory M. Brissey; Robert B. Spencer; Charles L. Wilkins

Publisher: Elsevier Science
Year: 1979
Tongue: English
Weight: 754 KB
Volume: 3
Category: Article
ISSN: 0097-8485
DOI: 10.1016/0097-8485(79)80002-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Molecular path for ligand search

✍ Tao Lu; Yuan Yuan Qiao; Pan Wen Shen 📂 Article 📅 2011 🏛 Chinese Electronic Periodical Services 🌐 English ⚖ 175 KB

Algorithms for path searching and for gr

Algorithms for path searching and for graph connectivity analysis

✍ A. Recuero 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 980 KB

Three algorithms for the search of oriented paths in digraphs are described, based in the generation of a tree, in which an BFS is done, in the first one, and a DFS is done, in the other two algorithms. The first one is aimed at finding all the optimum paths between two vertices. The second one is a

A model of self-avoiding random walks fo

A model of self-avoiding random walks for searching complex networks

✍ Víctor M. López Millán; Vicent Cholvi; Luis López; Antonio Fernández Anta 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 545 KB

The Fixed Point of a Generalization of t

The Fixed Point of a Generalization of the Renormalization Group Maps for Self-Avoiding Paths on Gaskets

✍ Tetsuya Hattori 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 259 KB

An optimal parallel algorithm for solvin

An optimal parallel algorithm for solving all-pairs shortest paths problem on circular-arc graphs

✍ Anita Saha; Madhumangal Pal; Tapan K. Pal 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 English ⚖ 232 KB

A new simple algorithm for enumerating a

A new simple algorithm for enumerating all minimal paths and cuts of a graph

✍ Yuanlong Shen 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 195 KB