Approximating the longest paths in grid graphs (Q719276): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.tcs.2011.06.010 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2011.06.010 / rank | |||
Normal rank | |||
Revision as of 08:04, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating the longest paths in grid graphs |
scientific article |
Statements
Approximating the longest paths in grid graphs (English)
0 references
10 October 2011
0 references
long paths
0 references
square-free 2-factor
0 references
grid graphs
0 references
approximation algorithm
0 references
0 references
