Fast Distributed DFS Solutions for Edge-Disjoint Paths in Digraphs

DOI10.1007/978-3-642-36751-9_13zbMath1388.68226OpenAlexW16234644MaRDI QIDQ4913839

Radu Nicolescu, Hossam ElGindy, 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

distributed systemsdepth-first searchnetwork flowP systemsedge-disjoint pathsmatrix grammarsgeneric rules

Mathematics Subject Classification ID

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

This page was built for publication: Fast Distributed DFS Solutions for Edge-Disjoint Paths in Digraphs