BFS Solution for Disjoint Paths in P Systems

DOI10.1007/978-3-642-21341-0_20zbMath1330.68342OpenAlexW2102734273MaRDI QIDQ3007713

Radu Nicolescu, Huiling Wu

Publication date: 17 June 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://idus.us.es/xmlui/handle/11441/39561

zbMATH Keywords

depth-first searchnetwork flowP systemsbreadth-first searchedge-disjoint pathsnode-disjoint paths

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 (5)

Parallel and Distributed Algorithms in P Systems ⋮ P system implementation of dynamic programming stereo ⋮ Simple Neural-Like P Systems for Maximal Independent Set Selection ⋮ A linear time complexity of breadth-first search using P system with membrane division ⋮ New solutions for disjoint paths in P systems

This page was built for publication: BFS Solution for Disjoint Paths in P Systems