A parallel approach to the Eulerian cycle problem

DOI10.1002/INT.10061MaRDI QIDQ4805480zbMATH OpenOpenAlexFDO

Authors T. Tambouratzis

Publication date 7 May 2003

Published in International Journal of Intelligent Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/int.10061

zbMATH Keywords

VLSI circuit designEulerian cyclesCPU accessRAM fault detection

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Finding Euler tours in parallel
• scientific article; zbMATH DE number 1372681
• scientific article; zbMATH DE number 3845030
• A parallel algorithm for approximating the minimum cycle cover
• scientific article; zbMATH DE number 2089184
• An optimal parallel algorithm for planar cycle separators
• scientific article; zbMATH DE number 1215999
• A study of the cyclic scheduling problem on parallel processors
• Parallel computation of the Euler number via Connectivity Graph
• scientific article; zbMATH DE number 966593

Cited in

(1)

• scientific article; zbMATH DE number 1784942 (Why is no real title available?)

This page was built for publication: A parallel approach to the Eulerian cycle problem

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