Name
Title | ||
|---|---|---|
Linearity and unprovability of set union problem strategies I: linearity of strong postorder |
Abstract | ||
|---|---|---|
In this paper we prove that strong postorder path compression systems have linear growth. |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1006/jagm.1996.0815 | J. Algorithms |
Keywords | DocType | Volume |
strong postorder,set union problem strategy | Journal | 23 |
Issue | ISSN | Citations |
2 | 0196-6774 | 4 |
PageRank | References | Authors |
0.46 | 1 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Martin Loebl | 1 | 152 | 28.66 |
| Jaroslav Nešetřil | 2 | 1432 | 164.83 |