BFS Solution for Disjoint Paths in P Systems

DOI10.1007/978-3-642-21341-0_20zbMath1330.68342MaRDI 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 search; network flow; P systems; breadth-first search; edge-disjoint paths; node-disjoint paths

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

05C38: Paths and cycles

68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)

68W15: Distributed algorithms

05C21: Flows in graphs