Analysis and Enumeration Algorithms for Biological Graphs
all maximal directed acyclic subgraphs of a graph G whose sources and targets belong to a predefined subset of the vertices, is on the other hand an example of an enumeration problem with an exponential number of solutions, that can be solved by using a non trivial brute-force approach. Given a meta...
| Main Author: | |
|---|---|
| Format: | eBook |
| Language: | English |
| Published: |
Paris
Atlantis Press
2015, 2015
|
| Edition: | 1st ed. 2015 |
| Series: | Atlantis Studies in Computing
|
| Subjects: | |
| Online Access: | |
| Collection: | Springer eBooks 2005- - Collection details see MPG.ReNa |
Table of Contents:
- Introduction
- Enumeration Algorithms
- An Application: Biological Graph Analysis
- Telling Stories: Enumerating maximal directed acyclic graphs with constrained set of sources and targets
- Enumerating bubbles: listing pairs of vertex disjoint paths
- Enumerating Cycles and (s,t)-Paths in Undirected Graphs
- Enumerating Diametral and Radial vertices and computing Diameter and Radius of a graph
- Conclusions