Paper Info
Title
Linearity and Unprovability of Set Union Problem Strategies
Abstract
In this paper we prove that strong postorder path compression systems have linear growth.
Year
DOI
Venue
1988
10.1006/jagm.1996.0815
Journal of Algorithms
Field
DocType
Volume
Discrete mathematics,Mathematical optimization,Computer science,Linearity,Calculus
Conference
23
Issue
ISSN
Citations 
2
0196-6774
5
PageRank 
References 
Authors
0.56
7
2
Name
Order
Citations
PageRank
Martin Loebl115228.66
Jaroslav Nesetril239259.16