T. Miyazaki. The complexity of mckay's canonical labeling algorithm. In Groups and Computation II, pages 239--256, 1995. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Solving Difficult Instances of Boolean Satisfiability .. - Aloul, Ramani.. (2002) (Correct)
.... room for future improvement given that (i) the graph automorphism problem is thought to not be NP complete, thus potentially easier than SAT, and (ii) much less new research was done in recent years on the analysis and design of high performance engines for graph automorphism (such works include [40, 36]) To be precise, in this work we will be dealing with the colored variant of the graph automorphism problem that can be easily extended to hypergraphs. Besides complexity theoretic connections between variants of Boolean satisfiability, symmetries, and the hypergraph automorphism problem [4, ....
....of partition refinement completes in three passes and does not require follow up backtracking for all but an exponentially small family of graphs [5, p. 1513] However, exponential worst cases have been constructed even for very sophisticated versions [38] both theoretically and empirically [40]. The graph automorphism problem may be constrained by vertex labels symmetries must map each vertex into a vertex with the same label. Label constraints are computationally easy and can be formally reduced to plain graph automorphism. Labels are often expressed by integers and called colors ....
T. Miyazaki, "The Complexity of McKay's Canonical Labeling Algorithm", In L. Finkelstein and W. M. Kantor, eds, Groups and Computation II, Workshop on Groups and Computation, DIMACS Series on Discrete Mathematics and Theor. Computer Science, 1996.
Symmetry-Breaking Predicates for Search Problems - Crawford, Ginsberg, Luks, Roy (1996) (48 citations) (Correct)
....x and y to it) This is important because some of the instances we consider have a huge number of binary clauses and some of the algorithms that follow are quadratic, or worse, in the number of nodes. examples of infinite classes of graphs which drive nauty to provably exponential behavior [ Miyazaki, 1996 ] 3. From the generators of the automorphism group we construct the symmetry tree and then generate the symmetry breaking predicate. As expected, in many cases computing the entire symmetrybreaking predicate is computationally infeasible. We use several approximations to compute partial ....
Takunari Miyazaki. The complexity of McKay's canonical labeling algorithm. In L. Finkelstein and W. M. Kantor, editors, Groups and Computation II, Workshop on Groups and Computation, volume to appear of DIMACS Series on Discrete Mathematics and Theoretical Computer Science, 1996.
Research Summary - Miyazaki Self-citation (Miyazaki) (Correct)
....of its as yet unresolved membership status in the complexity classes P and NP complete. In practice, ISO is not particularly regarded to be dicult. For example, B. McKay s system nauty [10] available as part of both GAP and Magma, is widely known for its remarkable performance; yet, my work [11] has demonstrated that there are certain dicult instances. Graph isomorphism algorithms have found many important applications in a wide range of areas exhibiting symmetries, including networks, boolean circuits, coding theory, constraint satisfaction problems, and chemistry (see, e.g. 4] and ....
....impressive are a large library of practical implementations based on these asymptotically ecient algorithms (cf. 5] Essentially all of these algorithms have their roots in the pioneering techniques of C. C. Sims proposed earlier in the late sixties [14] 1 Takunari Miyazaki 2 My rst paper [11] investigates ISO from a practical viewpoint with theoretical questions. In particular, the study focuses on the underlying backtrack algorithms of the system nauty. Although nauty is believed to perform remarkably well in general, it is shown that there is an in nite family of pairs of cubic ....
T. Miyazaki, The complexity of McKay's canonical labeling algorithm, Groups and Computation. II (L. Finkelstein and W. M. Kantor, eds.), DIMACS Ser. Discrete Math. Theoret. Comput. Sci., vol. 28, Amer. Math. Soc., Providence, R.I., 1997, pp. 239-256.
Exploiting Structure in Symmetry Detection for CNF - Paul Darga Mark (2004) (1 citation) (Correct)
No context found.
T. Miyazaki. The complexity of mckay's canonical labeling algorithm. In Groups and Computation II, pages 239--256, 1995.
Solving Difficult Instances of Boolean Satisfiability .. - Aloul, Ramani.. (2003) (Correct)
No context found.
T. Miyazaki, "The complexity of Mckay's canonical labeling algorithm, " in Proc. Groups Computat. II , Workshop Groups Computat., DIMACS Series on Discrete Math. Theor. Comput. Sci., L. Finkelstein and W. M. Kantor, Eds., 1996.
Exploiting Structure in Symmetry Detection for CNF - Darga, Liffiton, Sakallah.. (2004) (1 citation) (Correct)
No context found.
T. Miyazaki. The complexity of mckay's canonical labeling algorithm. In Groups and Computation II, pages 239--256, 1995.
Interconnect Synthesis for Systems on Chip - Bambha, Bhattacharyya (2004) (Correct)
No context found.
T. Miyazaki, The complexity of McKay's canonical labeling algorithm, Groups and Computation II 28 (1997), 239--256.
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