Solving cheap graph problems on Meshes

DOI10.1007/3-540-60246-1_147zbMATH Open1193.68199OpenAlexW1550004540MaRDI QIDQ3569029FDOQ3569029

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

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

Mathematics Subject Classification ID

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

Cited In (2)

• Solving fundamental problems on sparse-meshes
• Title not available (Why is that?)

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)