Sciweavers

1201 search results - page 128 / 241
» Linear Probing and Graphs
Sort
View
92
Voted
ICCSA
2009
Springer
15 years 7 months ago
YAO: A Software for Variational Data Assimilation Using Numerical Models
Variational data assimilation consists in estimating control parameters of a numerical model in order to minimize the misfit between the forecast values and some actual observatio...
Luigi Nardi, Charles Sorror, Fouad Badran, Sylvie ...
93
Voted
GD
2004
Springer
15 years 6 months ago
Computing Radial Drawings on the Minimum Number of Circles
A radial drawing is a representation of a graph in which the vertices lie on concentric circles of finite radius. In this paper we study the problem of computing radial drawings ...
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta,...
FOCS
1998
IEEE
15 years 5 months ago
Parametric and Kinetic Minimum Spanning Trees
We consider the parametric minimum spanning tree problem, in which we are given a graph with edge weights that are linear functions of a parameter and wish to compute the sequenc...
Pankaj K. Agarwal, David Eppstein, Leonidas J. Gui...
FOSSACS
2006
Springer
15 years 4 months ago
Register Allocation After Classical SSA Elimination is NP-Complete
Chaitin proved that register allocation is equivalent to graph coloring and hence NP-complete. Recently, Bouchez, Brisk, and Hack have proved independently that the interference gr...
Fernando Magno Quintão Pereira, Jens Palsbe...
98
Voted
CSR
2008
Springer
15 years 2 months ago
Comparing Universal Covers in Polynomial Time
The universal cover TG of a connected graph G is the unique (possible infinite) tree covering G, i.e., that allows a locally bijective homomorphism from TG to G. Universal covers h...
Jirí Fiala, Daniël Paulusma