New solutions for disjoint paths in P systems

DOI10.1007/S11047-012-9342-9zbMath1331.68287OpenAlexW2787687967MaRDI QIDQ256435

Radu Nicolescu, Huiling Wu

Publication date: 9 March 2016

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-012-9342-9

zbMATH Keywords

digraphsdistributed algorithmsdepth-first searchnetwork flowP systemsbreadth-first searchCidon's depth-first searchedge-disjoint pathsEdmonds-KarpFord-Fulkersonmessage-basednode-disjoint pathssynchronous

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Distributed algorithms (68W15) Flows in graphs (05C21)

Related Items (3)

A linear time complexity of breadth-first search using P system with membrane division ⋮ Testing based on identifiable P systems using cover automata and X-machines ⋮ New solutions for disjoint paths in P systems

Uses Software

• NetworkX
• SciPy

Cites Work

• New solutions for disjoint paths in P systems
• Computing with membranes
• BFS Solution for Disjoint Paths in P Systems
• A Faster P Solution for the Byzantine Agreement Problem
• Maximal Flow Through a Network
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Introduction to Distributed Algorithms
• Node-Disjoint Paths on the Mesh and a New Trade-Off in VLSI Layout
• Unnamed Item

This page was built for publication: New solutions for disjoint paths in P systems