A linear time and space algorithm for detecting path intersection in \(\mathbb Z^d\) (Q638566): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.tcs.2011.04.019 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2011.04.019 / rank | |||
Normal rank | |||
Latest revision as of 23:22, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A linear time and space algorithm for detecting path intersection in \(\mathbb Z^d\) |
scientific article |
Statements
A linear time and space algorithm for detecting path intersection in \(\mathbb Z^d\) (English)
0 references
12 September 2011
0 references
Freeman code
0 references
lattice paths
0 references
self-intersection
0 references
radix tree
0 references
0 references
