Algorithms for the minimum non-separating path and the balanced connected bipartition problems on grid graphs (Q385485): Difference between revisions
From MaRDI portal
Latest revision as of 02:39, 7 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
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