348 research outputs found
Tutte's dichromate for signed graphs
We introduce the ``trivariate Tutte polynomial" of a signed graph as an
invariant of signed graphs up to vertex switching that contains among its
evaluations the number of proper colorings and the number of nowhere-zero
flows. In this, it parallels the Tutte polynomial of a graph, which contains
the chromatic polynomial and flow polynomial as specializations. The number of
nowhere-zero tensions (for signed graphs they are not simply related to proper
colorings as they are for graphs) is given in terms of evaluations of the
trivariate Tutte polynomial at two distinct points. Interestingly, the
bivariate dichromatic polynomial of a biased graph, shown by Zaslavsky to share
many similar properties with the Tutte polynomial of a graph, does not in
general yield the number of nowhere-zero flows of a signed graph. Therefore the
``dichromate" for signed graphs (our trivariate Tutte polynomial) differs from
the dichromatic polynomial (the rank-size generating function).
The trivariate Tutte polynomial of a signed graph can be extended to an
invariant of ordered pairs of matroids on a common ground set -- for a signed
graph, the cycle matroid of its underlying graph and its frame matroid form the
relevant pair of matroids. This invariant is the canonically defined Tutte
polynomial of matroid pairs on a common ground set in the sense of a recent
paper of Krajewski, Moffatt and Tanasa, and was first studied by Welsh and
Kayibi as a four-variable linking polynomial of a matroid pair on a common
ground set.Comment: 53 pp. 9 figure
A note on the largest number of red nodes in red-black trees
In this paper, we are interested in the number of red nodes in red-black
trees. We first present an time dynamic programming solution for
computing , the largest number of red internal nodes in a red-black tree
on keys. Then the algorithm is improved to some time recursive
and nonrecursive algorithms. Based on these improved algorithms we finally find
a closed-form solution of
Top-Down Skiplists
We describe todolists (top-down skiplists), a variant of skiplists (Pugh
1990) that can execute searches using at most
binary comparisons per search and that have amortized update time
. A variant of todolists, called working-todolists,
can execute a search for any element using binary comparisons and have amortized search time
. Here, is the "working-set number" of
. No previous data structure is known to achieve a bound better than
comparisons. We show through experiments that, if implemented
carefully, todolists are comparable to other common dictionary implementations
in terms of insertion times and outperform them in terms of search times.Comment: 18 pages, 5 figure
A Static Optimality Transformation with Applications to Planar Point Location
Over the last decade, there have been several data structures that, given a
planar subdivision and a probability distribution over the plane, provide a way
for answering point location queries that is fine-tuned for the distribution.
All these methods suffer from the requirement that the query distribution must
be known in advance.
We present a new data structure for point location queries in planar
triangulations. Our structure is asymptotically as fast as the optimal
structures, but it requires no prior information about the queries. This is a
2D analogue of the jump from Knuth's optimum binary search trees (discovered in
1971) to the splay trees of Sleator and Tarjan in 1985. While the former need
to know the query distribution, the latter are statically optimal. This means
that we can adapt to the query sequence and achieve the same asymptotic
performance as an optimum static structure, without needing any additional
information.Comment: 13 pages, 1 figure, a preliminary version appeared at SoCG 201
A Unified approach to concurrent and parallel algorithms on balanced data structures
Concurrent and parallel algorithms are different. However, in the case of dictionaries, both kinds of algorithms share many
common points. We present a unified approach emphasizing these points. It is based on a careful analysis of the sequential
algorithm, extracting from it the more basic facts, encapsulated later on as local rules. We apply the method to the
insertion algorithms in AVL trees. All the concurrent and parallel insertion algorithms have two main phases. A
percolation phase, moving the keys to be inserted down, and a rebalancing phase. Finally, some other algorithms and
balanced structures are discussed.Postprint (published version
A Pedagogically Sound yet Efficient Deletion algorithm for Red-Black Trees: The Parity-Seeking Delete Algorithm
Red-black (RB) trees are one of the most efficient variants of balanced
binary search trees. However, they have always been blamed for being too
complicated, hard to explain, and not suitable for pedagogical purposes.
Sedgewick (2008) proposed left-leaning red-black (LLRB) trees in which red
links are restricted to left children, and proposed recursive concise insert
and delete algorithms. However, the top-down deletion algorithm of LLRB is
still very complicated and highly inefficient. In this paper, we first consider
2-3 red-black trees in which both children cannot be red. We propose a
parity-seeking delete algorithm with the basic idea of making the deficient
subtree on a par with its sibling: either by fixing the deficient subtree or by
making the sibling deficient, as well, ascending deficiency to the parent node.
This is the first pedagogically sound algorithm for the delete operation in
red-black trees. Then, we amend our algorithm and propose a parity-seeking
delete algorithm for classical RB trees. Our experiments show that, despite
having more rotations, 2-3 RB trees are almost as efficient as RB trees and
twice faster than LLRB trees. Besides, RB trees with the proposed
parity-seeking delete algorithm have the same number of rotations and almost
identical running time as the classic delete algorithm. While being extremely
efficient, the proposed parity-seeking delete algorithm is easily
understandable and suitable for pedagogical purposes
- …