✦ LIBER ✦

A worm algorithm for the fully-packed loop model

✍ Scribed by Wei Zhang; Timothy M. Garoni; Youjin Deng

Book ID: 116797603
Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 421 KB
Volume: 814
Category: Article
ISSN: 0550-3213
DOI: 10.1016/j.nuclphysb.2009.01.007

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Configurational statistics of densely an

Configurational statistics of densely and fully packed loops in the negative-weight percolation model

✍ O. Melchert; A. K. Hartmann 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 509 KB

Algorithms for the Relaxed Online Bin-Pa

Algorithms for the Relaxed Online Bin-Packing Model

✍ Gambosi, Giorgio; Postiglione, Alberto; Talamo, Maurizio 📂 Article 📅 2000 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 230 KB

A computational algorithm for loop closu

A computational algorithm for loop closure and application to modeling of the hypervariable loops in antibodies

✍ C.M. Venkatachalam; D.J. Edwards; E.A. Potterton; R.E. Hubbard 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 169 KB

The loop-cluster algorithm for the case

The loop-cluster algorithm for the case of the 6 vertex model

✍ Hans Gerd Evertz; Mihai Marcu 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 303 KB

A fully conservative particle algorithm

A fully conservative particle algorithm for the Boltzmann equation

✍ S.L. Popyrin 📂 Article 📅 1989 🏛 Elsevier Science ⚖ 426 KB

A Fully Dynamic Algorithm for Maintainin

A Fully Dynamic Algorithm for Maintaining the Transitive Closure

✍ Valerie King; Garry Sagert 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 170 KB

This paper presents an efficient fully dynamic graph algorithm for maintaining the transitive closure of a directed graph. The algorithm updates the adjacency matrix of the transitive closure with each update to the graph; hence, each reachability query of the form ''Is there a directed path from i