Computational Science - ICCS 2004

DOI10.1007/B97987zbMATH Open1095.68624OpenAlexW4205955456MaRDI QIDQ5712868

Sun-Yuan Hsieh

Publication date: 23 December 2005

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

Full work available at URL: https://doi.org/10.1007/b97987

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Parallel algorithms in computer science (68W10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

Notes on 'divide-and-conquer-based optimal parallel algorithms for some graph problems on EREW PRAM model'

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Efficient parallel algorithms for graph problems 👍 👎
• Efficiently parallelizable problems on a class of decomposable graphs 👍 👎
• Efficient Parallel Algorithms for a Class of Graph Theoretic Problems 👍 👎
• Optimal parallel colouring algorithms for totally decomposable graphs 👍 👎
• Characterization of Efficiently Parallel Solvable Problems on Distance-Hereditary Graphs 👍 👎
• Efficient Parallel Shortest-Paths in Digraphs with a Separator Decomposition 👍 👎

This page was built for publication: Computational Science - ICCS 2004

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