Parallel mesh algorithms for grid graph shortest paths with application to separation of touching chromosomes (Q1386454)
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: Parallel mesh algorithms for grid graph shortest paths with application to separation of touching chromosomes |
scientific article; zbMATH DE number 1154604
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parallel mesh algorithms for grid graph shortest paths with application to separation of touching chromosomes |
scientific article; zbMATH DE number 1154604 |
Statements
Parallel mesh algorithms for grid graph shortest paths with application to separation of touching chromosomes (English)
0 references
12 August 1998
0 references
grid graph shortest path
0 references
0.7110637426376343
0 references
0.7090630531311035
0 references
0.7074217200279236
0 references