Cargando…
Exploiting bounded signal flow for graph orientation based on cause-effect pairs
BACKGROUND: We consider the following problem: Given an undirected network and a set of sender-receiver pairs, direct all edges such that the maximum number of "signal flows" defined by the pairs can be routed respecting edge directions. This problem has applications in understanding prote...
Autores principales: | Dorn, Britta, Hüffner, Falk, Krüger, Dominikus, Niedermeier, Rolf, Uhlmann, Johannes |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2011
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3189099/ https://www.ncbi.nlm.nih.gov/pubmed/21867496 http://dx.doi.org/10.1186/1748-7188-6-21 |
Ejemplares similares
Ejemplares similares
-
A graph modification approach for finding core–periphery structures in protein interaction networks
por: Bruckner, Sharon, et al.
Publicado: (2015) -
Upper and lower bounds for the mass of the geodesic flow on graphs
por: Coornaert, M, et al.
Publicado: (1995) -
On the Treewidths of Graphs of Bounded Degree
por: Song, Yinglei, et al.
Publicado: (2015) -
Methyltransferase Inhibitors: Competing with, or Exploiting the Bound Cofactor
por: Ferreira de Freitas, Renato, et al.
Publicado: (2019) -
Exploiting social graph networks for emotion prediction
por: Khalid, Maryam, et al.
Publicado: (2023)