نتایج جستجو برای: canonization

تعداد نتایج: 216  

2008
Johannes Köbler Oleg Verbitsky

A function f of a graph is called a complete graph invariant if two given graphs G and H are isomorphic exactly when f(G) = f(H). If additionally, f(G) is a graph isomorphic to G, then f is called a canonical form for graphs. Gurevich [Gur97] proves that any polynomial-time computable complete invariant can be transformed into a polynomial-time computable canonical form. We extend this equivale...

Journal: :Theological Studies in Japan 1989

Journal: :ACM Journal of Experimental Algorithmics 2020

2013
Thomas Feulner

This work presents an algorithm for the computation of canonical forms of linear codes over arbitrary finite chain rings under the action of the linear isometry group. It is a generalization of a previous work by the author on the canonization of linear codes over finite fields. The algorithm is based on the ideas of partition refinements and it will compute the automorphism group of the code a...

2013
Johannes Köbler Sebastian Kuhnert Oleg Verbitsky

We present logspace algorithms for the canonical labeling problem and the representation problem of Helly circular-arc (HCA) graphs. The first step is a reduction to canonical labeling and representation of interval intersection matrices. In a second step, the Δ trees employed in McConnell’s linear time representation algorithm for interval matrices are adapted to the logspace setting and endow...

Journal: :JAMA: The Journal of the American Medical Association 1902

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید