Parameterized Complexity of Small Weight Automorphisms.

DOI10.4230/LIPIcs.STACS.2017.7zbMath1402.68080OpenAlexW2604142861MaRDI QIDQ4636604

Sebastian Kuhnert, V. Arvind, Johannes Köbler, Jacobo Toran

Publication date: 19 April 2018

Full work available at URL: http://dblp.uni-trier.de/db/conf/stacs/stacs2017.html#ArvindKKT17

zbMATH Keywords

parameterized algorithmshypergraph isomorphism

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Hypergraphs (05C65) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (2)

Finding Small Weight Isomorphisms with Additional Constraints is Fixed-Parameter Tractable ⋮ Parameterized complexity of small weight automorphisms and isomorphisms

This page was built for publication: Parameterized Complexity of Small Weight Automorphisms.