Fast distributed DFS solutions for edge-disjoint paths in digraphs (Q4913839)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Fast distributed DFS solutions for edge-disjoint paths in digraphs |
scientific article; zbMATH DE number 6154702
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast distributed DFS solutions for edge-disjoint paths in digraphs |
scientific article; zbMATH DE number 6154702 |
Statements
Fast Distributed DFS Solutions for Edge-Disjoint Paths in Digraphs (English)
0 references
16 April 2013
0 references
edge-disjoint paths
0 references
depth-first search
0 references
network flow
0 references
distributed systems
0 references
P systems
0 references
generic rules
0 references
matrix grammars
0 references
0.9482029676437378
0 references
0.849050760269165
0 references
0.7701338529586792
0 references
0.7501342296600342
0 references
0.7463581562042236
0 references
