Hypergraph isomorphism for groups with restricted composition factors

DOI10.4230/LIPICS.ICALP.2020.88MaRDI QIDQ6842483zbMATH OpenFDO

Authors Daniel Neuen

Publication date 18 March 2026

Copyright license Creative Commons Attribution 3.0 Unported

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2020.88

zbMATH Keywords

bounded genus graphsgraph isomorphismgroups with restricted composition factorshypergraphs

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cites work

• A faster isomorphism test for graphs of small degree
• A unifying method for the design of algorithms canonizing combinatorial objects
• An improved isomorphism test for bounded-tree-width graphs
• An optimal lower bound on the number of variables for graph identification
• Canonical form for graphs in quasipolynomial time: preliminary report
• Das Geschlecht des vollständigen paaren Graphen
• Embedding and canonizing graphs of bounded genus in logspace
• Faster canonical forms for primitive coherent configurations (extended abstract)
• Faster canonical forms for strongly regular graphs
• Graph isomorphism for unit square graphs
• Graph isomorphism in quasipolynomial time (extended abstract)
• scientific article; zbMATH DE number 3823850 (Why is no real title available?)
• scientific article; zbMATH DE number 706263 (Why is no real title available?)
• scientific article; zbMATH DE number 1849958 (Why is no real title available?)
• scientific article; zbMATH DE number 894528 (Why is no real title available?)
• Hypergraph isomorphism and structural equivalence of Boolean functions
• Isomorphism of graphs of bounded valence can be tested in polynomial time
• Isomorphism of graphs which are pairwise k-separable
• Isomorphism of k-contractible graphs. A generalization of bounded valence and bounded genus
• Isomorphism testing for graphs excluding small minors
• Isomorphism testing for graphs of bounded rank width
• On the orders of primitive groups with restricted nonabelian composition factors
• Polynomial-time normalizers
• Practical graph isomorphism. II.
• Quasipolynomial-time canonical form for steiner designs
• Structure theorem and isomorphism test for graphs with excluded topological subgraphs
• The isomorphism problem for classes of graphs closed under contraction
• Tight lower and upper bounds for the complexity of canonical colour refinement

Cited in

(2)

• Graph isomorphism in quasipolynomial time parameterized by treewidth
• Automorphisms and isomorphisms of maps in linear time

This page was built for publication: Hypergraph isomorphism for groups with restricted composition factors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6842483)