✦ LIBER ✦

Substructure, Subgraph, and Walk Counts as Measures of the Complexity of Graphs and Molecules

✍ Scribed by Rucker, G.; Rucker, C.

Book ID: 121883302
Publisher: American Chemical Society
Year: 2001
Tongue: English
Weight: 57 KB
Volume: 41
Category: Article
ISSN: 0095-2338
DOI: 10.1021/ci0100548

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

ChemInform Abstract: Substructure, Subgr

ChemInform Abstract: Substructure, Subgraph, and Walk Counts as Measures of the Complexity of Graphs and Molecules.

✍ Gerta Ruecker; Christoph Ruecker 📂 Article 📅 2010 🏛 John Wiley and Sons ⚖ 25 KB 👁 1 views

Walk Counts, Labyrinthicity, and Complex

Walk Counts, Labyrinthicity, and Complexity of Acyclic and Cyclic Graphs and Molecules

✍ Rucker, G.; Rucker, C. 📂 Article 📅 2000 🏛 American Chemical Society 🌐 English ⚖ 353 KB

ChemInform Abstract: Walk Counts, Labyri

ChemInform Abstract: Walk Counts, Labyrinthicity, and Complexity of Acyclic and Cyclic Graphs and Molecules.

✍ Gerta Ruecker; Christoph Ruecker 📂 Article 📅 2010 🏛 John Wiley and Sons ⚖ 25 KB 👁 1 views

The complexity of counting self-avoiding

The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes

✍ Maciej Liśkiewicz; Mitsunori Ogihara; Seinosuke Toda 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 633 KB

Valiant (SIAM J. Comput. 8 (1979) 410 -421) showed that the problem of computing the number of simple s-t paths in graphs is #P-complete both in the case of directed graphs and in the case of undirected graphs. Welsh (Complexity: Knots, Colourings and Counting, Cambridge University Press, Cambridge,

On the complexity of graphs and molecule

On the complexity of graphs and molecules

✍ Steven H. Bertz 📂 Article 📅 1983 🏛 Springer 🌐 English ⚖ 359 KB

On the complexity of graphs and molecule

On the complexity of graphs and molecules

✍ Steven H. Bertz 📂 Article 📅 1983 🏛 Springer 🌐 English ⚖ 373 KB