Showing papers by "Richard Cole published in 1999"
TL;DR: It is shown that a minimal edge-coloring of G can be computed in O(E logD time), which follows from an algorithm for finding a matching in a regular bipartite graph in O (E) time.
Abstract: Let $V$, $E$, and $D$ denote the cardinality of the vertex set, the cardinality of the edge set, and the maximum degree of a bipartite multigraph $G$. We show that a minimal edge-coloring of $G$ can be computed in $O(E\log D)$ time.
205 citations
Proceedings Article•
01 Jan 1999TL;DR: In this article, a data structure on trees which allows for the following operations, all in worst-case constant time: insertion of leaves and internal nodes, deletion of leaves, 3. deletion of internal nodes with only one child, determining the least common ancestor of any two nodes.
Abstract: We show how to maintain a data structure on trees which allows for the following operations, all in worst-case constant time: 1. insertion of leaves and internal nodes, 2. deletion of leaves, 3. deletion of internal nodes with only one child, 4. determining the least common ancestor of any two nodes. We also generalize the Dietz-Sleator "cup-filling" scheduling methodology, which may be of independent interest.
138 citations
Proceedings Article•
01 Jan 1999TL;DR: The main goal of this paper is to give an O(nlog3 n) time deterministic algorithm for the the Subset Matching problem, which immediately yields an algorithm of the same efficiency for the Tree pattern matching problem.
Abstract: The main goal of this paper is to give an O(nlog3 n) time deterministic algorithm for the the Subset Matching problem. This immediately yields an algorithm of the same efficiency for the Tree Pattern Matching problem. We also give an O(n log3 n/ log log n) time randomized algorithm for these problems. Finally, we give a O(nlog n(z + logn)) time deterministic algorithm for a useful specialization of the Subset Matching problem in which all sets are intervals of a given length Z.
67 citations
16 Feb 1999
TL;DR: This paper presents visualizations of binary search trees and splay trees, which comprise sequences of figures or frames, called comic strips, that are implemented in Java to facilitate their wide use.
Abstract: This paper presents visualizations of binary search trees and splay trees. The visualizations comprise sequences of figures or frames, called comic strips. Consecutive frames are viewed two at a time to facilitate user (viewer) understanding of the algorithm steps. The visualizations are implemented in Java to facilitate their wide use. This paper explores several other considerations in the design of instructional visualizations.
11 citations