Sciweavers

595 search results - page 78 / 119
» Incidence of
Sort
View
COCOON
2001
Springer
15 years 10 months ago
A Space Saving Trick for Directed Dynamic Transitive Closure and Shortest Path Algorithms
We present a simple space saving trick that applies to many previous algorithms for transitive closure and shortest paths in dynamic directed graphs. In these problems, an update c...
Valerie King, Mikkel Thorup
COCOON
2001
Springer
15 years 10 months ago
Finding the Most Vital Node of a Shortest Path
In an undirected, 2-node connected graph G = (V, E) with positive real edge lengths, the distance between any two nodes r and s is the length of a shortest path between r and s in ...
Enrico Nardelli, Guido Proietti, Peter Widmayer
ESOP
2001
Springer
15 years 10 months ago
The Def-inite Approach to Dependency Analysis
Abstract. We propose a new representation for the domain of Definite Boolean functions. The key idea is to view the set of models of a Boolean function as an incidence relation be...
Samir Genaim, Michael Codish
APSEC
1999
IEEE
15 years 10 months ago
Testing, Reliability, and Interoperability Issues in the CORBA Programming Paradigm
CORBA (Common Object Request Broker Architecture) is widely perceived as an emerging platform for distributed systems development. In this paper, we discuss CORBA's testing, ...
Gang Xing, Michael R. Lyu
ASPDAC
1999
ACM
93views Hardware» more  ASPDAC 1999»
15 years 10 months ago
Optimization of Linear Placements for Wirelength Minimization with Free Sites
We study a type of linear placement problem arising in detailed placement optimization of a given cell row in the presence of white-space (extra sites). In this single-row placeme...
Andrew B. Kahng, Paul Tucker, Alexander Zelikovsky