Skip to main content
Fig. 1 | Algorithms for Molecular Biology

Fig. 1

From: Connectivity problems on heterogeneous graphs

Fig. 1

Examples of well studied network problems (a), and their corresponding extension with multiple conditions (b). The problems shown are: Undirected Steiner Tree, Directed Steiner Network, and Shortest Path, respectively. Yellow nodes and red edges correspond to nodes and edges used in the optimal solutions for the corresponding instances

Back to article page

Algorithms for Molecular Biology

ISSN: 1748-7188