2,787 research outputs found
Linear Time LexDFS on Cocomparability Graphs
Lexicographic depth first search (LexDFS) is a graph search protocol which
has already proved to be a powerful tool on cocomparability graphs.
Cocomparability graphs have been well studied by investigating their
complements (comparability graphs) and their corresponding posets. Recently
however LexDFS has led to a number of elegant polynomial and near linear time
algorithms on cocomparability graphs when used as a preprocessing step [2, 3,
11]. The nonlinear runtime of some of these results is a consequence of
complexity of this preprocessing step. We present the first linear time
algorithm to compute a LexDFS cocomparability ordering, therefore answering a
problem raised in [2] and helping achieve the first linear time algorithms for
the minimum path cover problem, and thus the Hamilton path problem, the maximum
independent set problem and the minimum clique cover for this graph family
Computing Groebner Fans
This paper presents algorithms for computing the Groebner fan of an arbitrary
polynomial ideal. The computation involves enumeration of all reduced Groebner
bases of the ideal. Our algorithms are based on a uniform definition of the
Groebner fan that applies to both homogeneous and non-homogeneous ideals and a
proof that this object is a polyhedral complex. We show that the cells of a
Groebner fan can easily be oriented acyclically and with a unique sink,
allowing their enumeration by the memory-less reverse search procedure. The
significance of this follows from the fact that Groebner fans are not always
normal fans of polyhedra in which case reverse search applies automatically.
Computational results using our implementation of these algorithms in the
software package Gfan are included.Comment: 26 page
- …