Sciweavers

4315 search results - page 213 / 863
» Sorting in linear time
Sort
View
COCOON
2005
Springer
14 years 2 months ago
Radial Coordinate Assignment for Level Graphs
We present a simple linear time algorithm for drawing level graphs with a given ordering of the vertices within each level. The algorithm draws in a radial fashion without changing...
Christian Bachmaier, Florian Fischer, Michael Fors...
IPPS
1999
IEEE
14 years 1 months ago
PARADIGM (version 2.0): A New HPF Compilation System
In this paper,a we present sample performance figures for a new linear algebra-based compilation framework implemented in a research HPF compiler called PARADIGM. The metrics cons...
Pramod G. Joisha, Prithviraj Banerjee
TIME
1994
IEEE
14 years 1 months ago
A Temporal Structure that Distinguishes between the Past, Present, and Future
We present a two dimensional temporal structure that has an ever changing present. Relative to each present, there is a past and future. The main representational advantage our tw...
André Trudel
SWAT
1994
Springer
130views Algorithms» more  SWAT 1994»
14 years 1 months ago
Dominating Cliques in Distance-Hereditary Graphs
A graph is distance-hereditary if and only if each cycle on five or more vertices has at least two crossing chords. We present linear time algorithms for the minimum r-dominating c...
Feodor F. Dragan
CCCG
2008
13 years 10 months ago
Triangulating and Guarding Realistic Polygons
We propose a new model of realistic input: k-guardable objects. An object is k-guardable if its boundary can be seen by k guards in the interior of the object. In this abstract, w...
Greg Aloupis, Prosenjit Bose, Vida Dujmovic, Chris...