Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
[ספר][B] Graphs on surfaces and their applications
SK Lando, AK Zvonkin - 2013 - books.google.com
Graphs drawn on two-dimensional surfaces have always attracted researchers by their
beauty and by the variety of difficult questions to which they give rise. The theory of such …
beauty and by the variety of difficult questions to which they give rise. The theory of such …
Isomorphism of graphs of bounded valence can be tested in polynomial time
EM Luks - Journal of computer and system sciences, 1982 - Elsevier
Suppose we are given a set of generators for a group G of permutations of a colored set A.
The color automorphism problem for G involves finding generators for the subgroup of G …
The color automorphism problem for G involves finding generators for the subgroup of G …
[ספר][B] Handbook of computational group theory
DF Holt, B Eick, EA O'Brien - 2005 - taylorfrancis.com
The origins of computation group theory (CGT) date back to the late 19th and early 20th
centuries. Since then, the field has flourished, particularly during the past 30 to 40 years, and …
centuries. Since then, the field has flourished, particularly during the past 30 to 40 years, and …
The transitive groups of degree up to eleven
INTRODUCTION Biggs in [El states that Kirkman [see ibid. ref. 63.21 had by 1863 a
recursive method for determining permutation groups of low degree. In this he has clear …
recursive method for determining permutation groups of low degree. In this he has clear …
Computational complexity and the classification of finite simple groups
We address the graph isomorphism problem and related fundamental complexity problems
of computational group theory. The main results are these: A1. A polynomial time algorithm …
of computational group theory. The main results are these: A1. A polynomial time algorithm …
[ספר][B] Group-theoretic algorithms and graph isomorphism
CM Hoffmann - 1982 - Springer
Recall that the distance of a vertex u from a vertex v in the graph X is the length of a shortest
path between u and v. Similarly, if e=(vl, v2) is an edge of X, we define the distance of a …
path between u and v. Similarly, if e=(vl, v2) is an edge of X, we define the distance of a …
Graph isomorphism problem
VN Zemlyachenko, NM Korneenko… - Journal of Soviet …, 1985 - Springer
The article is a creative compilation of certain papers devoted to the graph isomorphism
problem, which have appeared in recent years. An approach to the isomorphism problem is …
problem, which have appeared in recent years. An approach to the isomorphism problem is …
Solvability by radicals is in polynomial time
Every high school student knows how to express the roots of a quadratic equation in terms of
radicals; what is less well-known is that this solution was found by the Babylonians a …
radicals; what is less well-known is that this solution was found by the Babylonians a …
[PDF][PDF] Fast Monte Carlo algorithms for permutation groups
Abstract We introduce new Monte Carlo methods to speed up and greatly simplify the
manipulation of permutation groups. The methods are of a combinatorial character and use …
manipulation of permutation groups. The methods are of a combinatorial character and use …
[PDF][PDF] Automorphism groups, isomorphism, reconstruction (Chapter 27 of the Handbook of Combinatorics)
2 monumental yet enjoyable work on distance-transitivity and related subjects with detailed
up-to-date information. Much of our current knowledge on graph isomorphism testing is …
up-to-date information. Much of our current knowledge on graph isomorphism testing is …