Canonizing hypergraphs under abelian group action

DOI10.1007/978-3-642-22685-4_39MaRDI QIDQ3087970zbMATH OpenOpenAlexFDO

Authors Vikraman Arvind, Johannes Köbler

Publication date 17 August 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-22685-4_39

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Hypergraphs (05C65) Graph algorithms (graph-theoretic aspects) (05C85) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• The parallel complexity of graph canonization under abelian group action
• A unifying method for the design of algorithms canonizing combinatorial objects
• On Hypergraph and Graph Isomorphism with Bounded Color Classes
• The Parallel Complexity of Abelian Permutation Group Problems
• scientific article; zbMATH DE number 841570

Cited in

(5)

• Colored hypergraph isomorphism is fixed parameter tractable
• The parallel complexity of graph canonization under abelian group action
• A unifying method for the design of algorithms canonizing combinatorial objects
• On Isomorphism and Canonization of Tournaments and Hypertournaments
• Isomorphism and canonization of tournaments and hypertournaments

This page was built for publication: Canonizing hypergraphs under abelian group action

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