登录 注册 会员服务 联系我们

Edge- and Node-Disjoint Paths in P Systems

  • Published:2010-10-30 Issue: Volume:40 Page:121-141
  • ISSN:2075-2180
  • Container-title:Electronic Proceedings in Theoretical Computer Science
  • language:en
  • Short-container-title:Electron. Proc. Theor. Comput. Sci.

Author:

Dinneen Michael J.1,Kim Yun-Bum1,Nicolescu Radu1

Affiliation:

1. University of Auckland

Publisher

Open Publishing Association

Reference17 articles.

1. New Solutions to the Firing Squad Synchronization Problem for Neural and Hyperdag P Systems;Michael J. Dinneen,2009

2. A Faster P Solution for the Byzantine Agreement Problem;Michael J. Dinneen,2010

3. P systems and the Byzantine agreement;Michael J. Dinneen;Journal of Logic and Algebraic Programming,2010

4. Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems;Jack Edmonds;J. ACM,1972

5. Maximal flow through a network;Lester R. Ford Jr.;Canadian Journal of Mathematics,1956

Cited by 9 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Topology Control for Guaranteed Connectivity Provisioning in Heterogeneous Sensor Networks;IEEE Sensors Journal;2016-06

2. Asynchronous P Systems;Natural Computing for Simulation and Knowledge Discovery;2014

3. Infobiotics Workbench: A P Systems Based Tool for Systems and Synthetic Biology;Emergence, Complexity and Computation;2013-12-18

4. A Linear Time Complexity of Breadth-First Search UsingPSystem with Membrane Division;Mathematical Problems in Engineering;2013

5. Fast Distributed BFS Solution for Edge-Disjoint Paths;Proceedings of The Eighth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA), 2013;2013
同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3