Sciweavers

5105 search results - page 155 / 1021
» An algorithm to determine peer-reviewers
Sort
View
WG
2009
Springer
15 years 7 months ago
Fully Dynamic Representations of Interval Graphs
We present a fully dynamic algorithm that maintains three different representations of an interval graph: a minimal interval model of the graph, the PQ-tree of its maximal cliques...
Christophe Crespelle
85
Voted
ESA
2009
Springer
130views Algorithms» more  ESA 2009»
15 years 7 months ago
Cauchy's Theorem for Orthogonal Polyhedra of Genus 0
A famous theorem by Cauchy states that a convex polyhedron is determined by its incidence structure and face-polygons alone. In this paper, we prove the same for orthogonal polyhe...
Therese C. Biedl, Burkay Genc
86
Voted
ANTS
2004
Springer
106views Algorithms» more  ANTS 2004»
15 years 6 months ago
The Discrete Logarithm in Logarithmic -Class Groups and Its Applications in K-theory
We present an algorithm for the computation of the discrete logarithm in logarithmic -Class Groups. This is applied to the calculation to the -rank of the wild kernel WK2 of a numb...
Sebastian Pauli, Florence Soriano-Gafiuk
109
Voted
GD
2001
Springer
15 years 5 months ago
Fast and Simple Horizontal Coordinate Assignment
Abstract. We present a simple, linear-time algorithm to determine horizontal coordinates in layered layouts subject to a given ordering within each layer. The algorithm is easy to ...
Ulrik Brandes, Boris Köpf
WAN
1998
Springer
15 years 4 months ago
Some Performance Studies in Exact Linear Algebra
We consider parallel algorithms for computing the Hermite normal form of matrices over Euclidean rings. We use standard types of reduction methods which are the basis of many algor...
George Havas, Clemens Wagner 0002