๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Connections for small vertex models

โœ Scribed by R. Srinivasan

Book ID
105624624
Publisher
Indian Academy of Sciences
Year
2000
Tongue
English
Weight
194 KB
Volume
110
Category
Article
ISSN
0253-4142

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Cluster algorithm for vertex models
Cluster algorithm for vertex models
โœ Evertz, Hans Gerd; Lana, Gideon; Marcu, Mihai ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› The American Physical Society ๐ŸŒ English โš– 349 KB
A Static 2-Approximation Algorithm for V
A Static 2-Approximation Algorithm for Vertex Connectivity and Incremental Approximation Algorithms for Edge and Vertex Connectivity
โœ Monika Rauch Henzinger ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 329 KB

This paper presents insertions-only algorithms for maintaining the exact andror approximate size of the minimum edge cut and the minimum vertex cut of a graph. ลฝ . The algorithms output the approximate or exact size k in time O 1 and a cut of size k in time linear in its size. For the minimum edge

Renormalization connection between the e
Renormalization connection between the eight-vertex model and the gaussian model
โœ H.J.F Knops ๐Ÿ“‚ Article ๐Ÿ“… 1980 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 915 KB

A generalized version of the Villain model is defined which contains the eight-vertex model as a special case. A renormalization pattern is formulated in terms of this Villain model by which critical line(s) in the eight-vertex model are connected with the Gaussian fixed line. Gaussian equivalents a

FPT algorithms for Connected Feedback Ve
FPT algorithms for Connected Feedback Vertex Set
โœ Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh, Somnath Sik ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Springer US ๐ŸŒ English โš– 584 KB