Fast distributed DFS solutions for edge-disjoint paths in digraphs

DOI10.1007/978-3-642-36751-9_13MaRDI QIDQ4913839zbMATH OpenOpenAlexFDO

Authors Hossam ElGindy, Radu Nicolescu, Huiling Wu

Publication date 16 April 2013

Published in Membrane Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-36751-9_13

zbMATH Keywords

depth-first searchdistributed systemsedge-disjoint pathsgeneric rulesmatrix grammarsnetwork flowP systems

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Recommendations

• New solutions for disjoint paths in P systems
• BFS Solution for Disjoint Paths in P Systems
• A new distributed depth-first-search algorithm
• Distributed algorithms for depth-first search
• An improvement of Goldberg, Plotkin and Vaidya's maximal node-disjoint paths algorithm

Cited in

(2)

• New solutions for disjoint paths in P systems
• Near-optimal distributed DFS in planar graphs

This page was built for publication: Fast distributed DFS solutions for edge-disjoint paths in digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4913839)