Analysis and enumeration. Algorithms for biological graphs

DOI10.2991/978-94-6239-097-3zbMATH Open1347.92002OpenAlexW4250400200MaRDI QIDQ2353660FDOQ2353660

Authors: 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

Recommendations

• Efficient enumeration of bipartite subgraphs in graphs
• Enumeration aspects of maximal cliques and bicliques
• Efficient enumeration of maximal induced bicliques
• Enumeration complexity
• Polynomial-delay enumeration of monotonic graph classes

zbMATH Keywords

biological graphs

Mathematics Subject Classification ID

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

Cited In (8)

• Title not available (Why is that?)
• Enumerating Minimal Dominating Sets in Triangle-Free Graphs
• 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
• Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs
• Graph theory analysis of genomics problems: Community analysis of fragile sites correlations and of pseudogenes alignments
• Experimental and Efficient Algorithms

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

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