New solutions for disjoint paths in P systems (Q256435)
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: New solutions for disjoint paths in P systems |
scientific article; zbMATH DE number 6552910
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New solutions for disjoint paths in P systems |
scientific article; zbMATH DE number 6552910 |
Statements
New solutions for disjoint paths in P systems (English)
0 references
9 March 2016
0 references
breadth-first search
0 references
Cidon's depth-first search
0 references
depth-first search
0 references
digraphs
0 references
distributed algorithms
0 references
edge-disjoint paths
0 references
Edmonds-Karp
0 references
Ford-Fulkerson
0 references
message-based
0 references
node-disjoint paths
0 references
network flow
0 references
P systems
0 references
synchronous
0 references
0.9482029676437378
0 references
0.8928820490837097
0 references
0.7747563719749451
0 references
0.7745718955993652
0 references
0.7736871242523193
0 references
