Solving cheap graph problems on Meshes

DOI10.1007/3-540-60246-1_147MaRDI QIDQ3569029zbMATH OpenOpenAlexFDO

Authors Michael Kaufmann, Jop F. Sibeyn

Publication date 17 June 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-60246-1_147

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Recommendations

• Graph Problems on a Mesh-Connected Processor Array
• Interval Graph Problems on Reconfigurable Meshes
• Time-optimal proximity graph computations on enhanced meshes
• Graph-Theoretic Solutions to Computational Geometry Problems
• Solving fundamental problems on sparse-meshes
• A new scheme for mesh generation and mesh refinement using graph theory
• STACS 2004
• An efficient multigrid method for graph Laplacian systems

Cited in

(4)

• An optimal distributed algorithm for recognizing mesh-connected networks
• Parallel mesh algorithms for grid graph shortest paths with application to separation of touching chromosomes
• scientific article; zbMATH DE number 1760013 (Why is no real title available?)
• Solving fundamental problems on sparse-meshes

This page was built for publication: Solving cheap graph problems on Meshes

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