High-performance algorithm engineering for large-scale graph problems and computational biology

DOI10.1007/11427186_3MaRDI QIDQ5710033zbMATH OpenOpenAlexFDO

Authors David A. Bader

Publication date 30 November 2005

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

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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Computational methods for problems pertaining to biology (92-08) Problems related to evolution (92D15)

Recommendations

• High-performance algorithm engineering for computational phylogenetics
• High-performance algorithm engineering for computational phylogenetics
• Efficient parallel algorithms for graph problems
• Analysis and enumeration. Algorithms for biological graphs
• Parallel graph algorithms for hypercube computers
• scientific article; zbMATH DE number 4068310
• Algorithm Engineering for Optimal Graph Bipartization

Cited in

(4)

• High-performance algorithm engineering for computational phylogenetics
• High-performance algorithm engineering for computational phylogenetics
• Locality behavior of parallel and sequential algorithms for irregular graph problems
• Engineering Motif Search for Large Graphs

This page was built for publication: High-performance algorithm engineering for large-scale graph problems and computational biology

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