Finding supported paths in heterogeneous networks
DOI10.3390/A8040810zbMATH Open1461.68151OpenAlexW1885685411MaRDI QIDQ1736715FDOQ1736715
Authors: Guillaume Fertin, Christian Komusiewicz, Hafedh Mohamed-Babou, Irena Rusu 
Publication date: 26 March 2019
Published in: Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/a8040810
Recommendations
- Algorithmic aspects of heterogeneous biological networks comparison
- Finding pathway structures in protein interaction networks
- Improved approaches to solve the one-to-one skewgram problem
- Complexity issues in vertex-colored graph pattern matching
- Nearly exact mining of frequent trees in large networks
metabolic networksshortest path problemNP-hard problemsdirected acyclic graphslongest path problemprotein interaction networks
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Systems biology, networks (92C42) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Paths and cycles (05C38)
Cites Work
- Title not available (Why is that?)
- A Dynamic Programming Approach to Sequencing Problems
- The directed subgraph homeomorphism problem
- Parametrized complexity theory.
- Title not available (Why is that?)
- On the parameterized complexity of multiple-interval graph problems
- Dynamic Programming Treatment of the Travelling Salesman Problem
- An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems
- Algorithmic aspects of heterogeneous biological networks comparison
Cited In (3)
Uses Software
This page was built for publication: Finding supported paths in heterogeneous networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1736715)
