research
∙
01/27/2001
Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings
Let G be an embedded planar undirected graph that has n vertices, m edge...
share
research
∙
01/23/2001
A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs
We propose a fast methodology for encoding graphs with information-theor...
research
∙
01/15/2001
Multiple-Size Divide-and-Conquer Recurrences
This short note reports a master theorem on tight asymptotic solutions t...
research
∙
01/14/2001