Analysis and enumeration. Algorithms for biological graphs

DOI10.2991/978-94-6239-097-3zbMath1347.92002OpenAlexW4250400200MaRDI QIDQ2353660

Andrea Marino

Publication date: 15 July 2015

Published in: Atlantis Studies in Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2991/978-94-6239-097-3

zbMATH Keywords

biological graphs

Mathematics Subject Classification ID

Applications of graph theory (05C90) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Paths and cycles (05C38) Research exposition (monographs, survey articles) pertaining to biology (92-02) Systems biology, networks (92C42) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items (6)

Enumerating floorplans with walls ⋮ Efficient enumeration of maximal split subgraphs and induced sub-cographs and related classes ⋮ Refined notions of parameterized enumeration kernels with applications to matching cut enumeration ⋮ Unnamed Item ⋮ Enumerating Minimal Dominating Sets in Triangle-Free Graphs ⋮ Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs

This page was built for publication: Analysis and enumeration. Algorithms for biological graphs