全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...
-  2019 

Connectivity problems on heterogeneous graphs

DOI: 10.1186/s13015-019-0141-z

Keywords: Steiner Network, NP hard, Approximation algorithm, Protein–protein interaction

Full-Text   Cite this paper   Add to My Lib

Abstract:

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 instance

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133