Algorithms for the minimum non-separating path and the balanced connected bipartition problems on grid graphs (Q385485): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C35 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C27 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C60 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6235160 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
approximation algorithm | |||
| Property / zbMATH Keywords: approximation algorithm / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
non-separating path | |||
| Property / zbMATH Keywords: non-separating path / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
balanced connected partition | |||
| Property / zbMATH Keywords: balanced connected partition / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
grid graphs | |||
| Property / zbMATH Keywords: grid graphs / rank | |||
Normal rank | |||
Revision as of 12:45, 29 June 2023
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
