Graph-Theoretic Concepts in Computer Science
From MaRDI portal
Publication:5897562
DOI10.1007/11604686zbMath1171.92316MaRDI QIDQ5897562
Stéphane Vialette, Guillaume Blin, Guillaume Fertin, Danny Hermelin
Publication date: 1 November 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Biochemistry, molecular biology (92C40) Computational methods for problems pertaining to biology (92-08)
Related Items (5)
Polynomial algorithms for protein similarity search for restricted mRNA structures ⋮ Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs ⋮ A branch-and-bound algorithm for the minimum cut linear arrangement problem ⋮ Fixed Parameter Tractable Alignment of RNA Structures Including Arbitrary Pseudoknots ⋮ Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time
This page was built for publication: Graph-Theoretic Concepts in Computer Science
