Nie masz uprawnień do wyświetlenia tego obiektu. Aby poprosić o dostęp do niego, wypełnij poniższe pola.
Musiał Grzegorz
artykuł
The paper presents the algorithm and subroutine GRGEN for generation of connected closed linear graphs utilized in perturbation expansions. Starting with polygons and subsequently choosing pairs of not directly connected vertices in already generated graphs, the algorithm consequently projects one vertex onto the other one in the pair, generating only topologically different graphs. This algorithm is independent of the choice of a specific model and lattice geometry. The procedure is written in the FORTRAN 77 language, and is available at the Poznań Supercomputing and Networking Center on the SGI Power Challenge XL supercomputer.
Poznań
OWN
application/pdf
oai:lib.psnc.pl:494
eng
2014-07-29
2014-05-22
237
https://lib.psnc.pl/publication/586
RDF
OAI-PMH
Ta strona wykorzystuje pliki 'cookies'. Więcej informacji Rozumiem