✦ LIBER ✦

A fast graph traversal algorithm for the computer enumeration of P-V paths of benzenoid graphs

✍ Scribed by M.M. Balakrishnarajan; P. Venuvanalingam

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 493 KB
Volume: 19
Category: Article
ISSN: 0097-8485
DOI: 10.1016/0097-8485(94)00056-k

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

A graph-theoretic algorithm for computin

A graph-theoretic algorithm for computing the number of invariant zeros of large scale systems

✍ F.Svaricek Duisburg 📂 Article 📅 1985 🏛 Elsevier Science ⚖ 250 KB

A Fast Direct Algorithm for the Solution

A Fast Direct Algorithm for the Solution of the Laplace Equation on Regions with Fractal Boundaries

✍ P. Jones; J. Ma; V. Rokhlin 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 655 KB

An algorithm is presented for the rapid direct solution of the Laplace equation on regions with fractal boundaries. In a typical application, the numerical simulation has to be on a very large scale involving at least tens of thousands of equations with as many unknowns, in order to obtain any meani

A call for the publishing of Blt-stones:

A call for the publishing of Blt-stones: DeFanti, T, Frankel, R and Leske, LIEEE Comput. Graph. & Applic. Vol 7 No 10 (1987) p 39

📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 122 KB