2485 search results - page 237 / 497 » Time Bounded Frequency Computations |
SWAT
1990
Springer
14 years 12 days ago
1990
Springer
We give improved solutions for the problem of generating the k smallest spanning trees in a graph and in the plane. Our algorithm for general graphs takes time O(m log (m, n) + k2...
IPL
2002
13 years 8 months ago
2002
We consider two aesthetic criteria for the visualization of rooted trees: inclusion and tip-over. Finding the minimum area layout according to either of these two standards is an ...
TPDS
1998
13 years 8 months ago
1998
The Optical Transpose Interconnection System (OTIS) is a recently proposed model of computing that exploits the special features of both electronic and optical technologies. In th...
ICALP
1995
Springer
13 years 12 months ago
1995
Springer
An infinite binary sequence x is defined to be (i) strongly useful if there is a computable time bound within which every decidable sequence is Turing reducible to x; and (ii) w...
TCOS
2010
13 years 6 months ago
2010
We propose an approximation method to answer point-to-point shortest path queries in undirected edge-weighted graphs, based on random sampling and Voronoi duals. We compute a simp...