Parameterized complexity of small weight automorphisms

DOI10.4230/LIPICS.STACS.2017.7MaRDI QIDQ4636604zbMATH OpenOpenAlexFDO

Authors Vikraman Arvind, Sebastian Kuhnert, Johannes Köbler, Jacobo Torán

Publication date 19 April 2018

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

zbMATH Keywords

hypergraph isomorphismparameterized algorithms

Mathematics Subject Classification ID

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

Recommendations

• Parameterized complexity of small weight automorphisms and isomorphisms
• Colored hypergraph isomorphism is fixed parameter tractable
• Finding Small Weight Isomorphisms with Additional Constraints is Fixed-Parameter Tractable
• Colored hypergraph isomorphism is fixed parameter tractable
• scientific article; zbMATH DE number 1302030

Cited in

(5)

• Parameterized complexity of small weight automorphisms and isomorphisms
• Colored hypergraph isomorphism is fixed parameter tractable
• scientific article; zbMATH DE number 1302030 (Why is no real title available?)
• The parameterized complexity of fixing number and vertex individualization in graphs
• Finding Small Weight Isomorphisms with Additional Constraints is Fixed-Parameter Tractable

This page was built for publication: Parameterized complexity of small weight automorphisms

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