Polynomial time analysis of toroidal periodic graphs

DOI10.1007/3-540-58201-0_97zbMath1422.68114OpenAlexW1566676051MaRDI QIDQ4632455

Franz Höfting, Egon Wanke

Publication date: 29 April 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-58201-0_97

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Paths and cycles (05C38) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Bounds on Positive Integral Solutions of Linear Diophantine Equations
• Strongly polynomial-time and NC algorithms for detecting cycles in periodic graphs
• The Organization of Computations for Uniform Recurrence Equations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Polynomial time analysis of toroidal periodic graphs