Circulant graphs and GCD and LCM of subsets

DOI10.1016/j.ipl.2014.07.014zbMath1353.11115arXiv1402.5449OpenAlexW2049583208MaRDI QIDQ477605

Igor E. Shparlinski, Joachim von zur Gathen

Publication date: 9 December 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1402.5449

zbMATH Keywords

computational complexityanalysis of algorithmsgraph algorithmscirculant graphsminimum cover

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Number-theoretic algorithms; complexity (11Y16) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)

Cites Work

• Unnamed Item
• Unnamed Item
• Editing graphs to satisfy degree constraints: a parameterized approach
• Parameterized reductions and algorithms for a graph editing problem that generalizes vertex cover
• The parameterized complexity of editing graphs for bounded degeneracy
• Approximation algorithms for combinatorial problems
• Algorithmic construction of sets for k -restrictions
• Factoring into coprimes in essentially linear time

This page was built for publication: Circulant graphs and GCD and LCM of subsets