On the public citation graph

Polynomial time algorithms for recognizing and isomorphism testing of cyclic tournaments

https://doi.org/10.1007/bf00053383
0 signed · 26 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/mana.19740600102openalex-snapshot
Untersuchungen von S‐Ringen, insbesondere im Gruppenring von p‐Gruppen
inferredcites →https://doi.org/10.1007/978-94-017-1972-8openalex-snapshot
Investigations in Algebraic Theory of Combinatorial Objects
inferredcites →https://doi.org/10.1007/bf01787700openalex-snapshot
Galois correspondence between permutation groups and cellular rings (association schemes)
inferredcites →https://doi.org/10.1007/bfb0089374openalex-snapshot
On Construction and Identification of Graphs
inferredcites →https://doi.org/10.1016/0021-8693(82)90281-2openalex-snapshot
A polynomial bound for the orders of primitive solvable groups
inferredcites →https://doi.org/10.1109/sfcs.1980.34openalex-snapshot
Polynomial-time algorithms for permutation groups
inferredcites →https://doi.org/10.1109/sfcs.1988.21943openalex-snapshot
Fast management of permutation groups
inferredcites →https://doi.org/10.1145/800061.808746openalex-snapshot
Canonical labeling of graphs
inferredcites →https://doi.org/10.21236/ad0705364openalex-snapshot
GRAPH THEORY
inferredcites →https://doi.org/10.2140/pjm.1963.13.775openalex-snapshot
Chapter I, from Solvability of groups of odd order, Pacific J. Math, vol. 13, no. 3 (1963
inferredcites →https://doi.org/10.2307/2314023openalex-snapshot
Finite Permutation Groups.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-46784-x_22openalex-snapshot
Recognizing Bipartite Incident-Graphs of Circulant Digraphs
inferred← citeshttps://doi.org/10.1007/bf02366131openalex-snapshot
On computation complexity problems concerning relation algebras
inferred← citeshttps://doi.org/10.1007/s10958-006-0217-4openalex-snapshot
Finding the automorphism group of a circulant association scheme in polynomial time
inferred← citeshttps://doi.org/10.1016/j.dam.2010.03.012openalex-snapshot
Powers of cycles, powers of paths, and distance graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2005.06.002openalex-snapshot
Circulant graphs: efficient recognizing and isomorphism testing
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2017.10.005openalex-snapshot
WITHDRAWN: Finding a cycle base of a permutation group in polynomial time
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2018.03.028openalex-snapshot
Finding a cycle base of a permutation group in polynomial time
inferred← citeshttps://doi.org/10.1016/s0012-365x(01)00270-9openalex-snapshot
Recognizing Knödel graphs
inferred← citeshttps://doi.org/10.1016/s0022-4049(97)00014-5openalex-snapshot
On the geometric graph isomorphism problem
inferred← citeshttps://doi.org/10.1090/s1061-0022-04-00833-7openalex-snapshot
Circulant graphs: recognizing and isomorphism testing in polynomial time
inferred← citeshttps://doi.org/10.1090/spmj/2004-15-06openalex-snapshot
inferred← citeshttps://doi.org/10.26493/2590-9770.1712.3ecopenalex-snapshot
Isomorphism testing of k-spanning tournaments is fixed parameter tractable
inferred← citeshttps://doi.org/10.37236/1363openalex-snapshot
Recognizing Circulant Graphs of Prime Order in Polynomial Time
inferred← citeshttps://doi.org/10.37236/1570openalex-snapshot
Recognizing Circulant Graphs in Polynomial Time: An Application of Association Schemes
inferred← citeshttps://doi.org/10.48550/arxiv.1702.05292openalex-snapshot
Finding a cycle base of a permutation group
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.