Algorithms for the minimum non-separating path and the balanced connected bipartition problems on grid graphs (Q385485)
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: Algorithms for the minimum non-separating path and the balanced connected bipartition problems on grid graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for the minimum non-separating path and the balanced connected bipartition problems on grid graphs |
scientific article |
Statements
Algorithms for the minimum non-separating path and the balanced connected bipartition problems on grid graphs (English)
0 references
2 December 2013
0 references
approximation algorithm
0 references
non-separating path
0 references
balanced connected partition
0 references
grid graphs
0 references
0.8343937993049622
0 references
0.797707200050354
0 references
0.7944144010543823
0 references
0.7915683388710022
0 references
0.7831292748451233
0 references
