Improvements of a numerical Algorithm for a certain Class of Colouring Problems
We re-derive an algorithm used to calculate solutions for the edge-colouring and dimer problems for planar graphs. The theoretical background for this includes Pfaffian and then as Grassmann Integrals. We develop a new algorithm which is slightly faster and not restricted to planar graphs, and use t...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | English |
| Published: |
Norges teknisk-naturvitenskapelige universitet, Institutt for fysikk
2014
|
| Subjects: | |
| Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-24823 |