✦ LIBER ✦

Orderly Algorithm to Enumerate Central Groupoids and Their Graphs

✍ Scribed by Tim Boykett

Book ID: 106277966
Publisher: Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year: 2006
Tongue: English
Weight: 329 KB
Volume: 23
Category: Article
ISSN: 1439-7617
DOI: 10.1007/s10114-005-0775-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithm to enumerate all rectangula

An algorithm to enumerate all rectangular dual graphs

✍ Katsunori Tani; Isao Shirakawa; Shuji Tsukiyama 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 832 KB

Automorphisms of Maps with a Given Under

Automorphisms of Maps with a Given Underlying Graph and Their Application to Enumeration

✍ Lin Fan Mao; Yan Pei Liu; Feng Tian 📂 Article 📅 2005 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 206 KB

Algorithms for searching explicit AND/OR

Algorithms for searching explicit AND/OR graphs and their applications to problem reduction search

✍ P.P. Chakrabarti 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 756 KB

Chakrabarti, P.P., Algorithms for searching explicit AND/OR graphs and their applications to problem reduction search, Artificial Intelligence 65 (1994) 329-345. We present algorithms for finding out optimal cost solutions of an explicit AND/OR graph. We show that these new algorithms can work on A

The State Reduction and Related Algorith

The State Reduction and Related Algorithms and Their Applications to the Study of Markov Chains, Graph Theory, and the Optimal Stopping Problem

✍ Isaac Sonin 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 221 KB

We discuss the State ReductionÂGTH (Grassmann, Taksar, Heyman) algorithm for recursively finding invariant measure. We demonstrate the relationship between this algorithm and the Freidlin Wentzell ``tree decomposition'' approach to study the characteristics of Markov chains. The structure of the Sta