GAP: Groups, Algorithms and Programs, Version 3, Release 4. Available via ftp from ftp.math.rwth-aachen.de, directory /pub/gap. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Structural Symmetry and Model Checking - Manku, Hojati, Brayton (6 citations) (Correct)
....description of an algorithm for computing Aut A, that draws ideas from computational group theory and uses the algorithm in Figure 1 as a backbone, is given in [Man97] We omit its discussion from this paper as it is yet to be implemented. We initially experimented with a software package called GAP [Gap] which offers a graph automorphism program called nauti [McK90] based on one of the earliest such programs written by McKay [McK81] It is natural to ask: Why write another graph automorphism program Existing packages are general purpose and carry around a lot of baggage. We found GAP to ....
....of an algorithm for computing Aut A, that draws ideas from computational group theory and uses the algorithm in Figure 1 as a backbone, is given in [Man97] We omit its discussion from this paper as it is yet to be implemented. We initially experimented with a software package called GAP [Gap] which offers a graph automorphism program called nauti [McK90] based on one of the earliest such programs written by McKay [McK81] It is natural to ask: Why write another graph automorphism program Existing packages are general purpose and carry around a lot of baggage. We found GAP to be ....
[Article contains additional citation context not shown here]
GAP: Groups, Algorithms and Programs, Version 3, Release 4. Available via ftp from ftp.math.rwth-aachen.de, directory /pub/gap.
Structural Symmetries and Model Checking - Manku, Hojati, Brayton (1998) (2 citations) (Correct)
....As we backtrack, we dynamically change base using the algorithms in [BFJ89] As we branch, we use the pruning mechanism described in [BL85] to avoid rediscovering any automorphism already in the group. We initially experimented with a software package for manipulating graphs and groups, GAP [Gap] which has a graph automorphism program called nauti [McK90] based on one of the earliest such programs written by McKay [McK81] A natural question to ask is: Why write another graph automorphism program Existing packages are general purpose and carry around a lot of baggage. We found GAP ....
....As we backtrack, we dynamically change base using the algorithms in [BFJ89] As we branch, we use the pruning mechanism described in [BL85] to avoid rediscovering any automorphism already in the group. We initially experimented with a software package for manipulating graphs and groups, GAP [Gap] which has a graph automorphism program called nauti [McK90] based on one of the earliest such programs written by McKay [McK81] A natural question to ask is: Why write another graph automorphism program Existing packages are general purpose and carry around a lot of baggage. We found GAP to ....
[Article contains additional citation context not shown here]
GAP: Groups, Algorithms and Programs, Version 3, Release 4. Available via ftp from ftp.math.rwth-aachen.de, Lehrstuhl D fuer Mathematik, RWTH Aachen, Germany; directory /pub/gap.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC