Sciweavers

672 search results - page 75 / 135
» Lower-stretch spanning trees
Sort
View
ADBIS
2004
Springer
134views Database» more  ADBIS 2004»
14 years 2 months ago
Towards Quadtree-Based Moving Objects Databases
Nowadays, one of the main research issues of great interest is the efficient tracking of mobile objects that enables the effective answering of spatiotemporal queries. This line o...
Katerina Raptopoulou, Michael Vassilakopoulos, Yan...
EACL
1993
ACL Anthology
13 years 10 months ago
Towards efficient parsing with proof-nets
This paper presents a method for parsing associative Lambek grammars based on graphtheoretic properties. Connection graphs, which are a simplified version of proof-nets, are actua...
Alain Lecomte
ALGORITHMICA
2010
147views more  ALGORITHMICA 2010»
13 years 9 months ago
Note on the Structure of Kruskal's Algorithm
We study the merging process when Kruskal's algorithm is run with random graphs as inputs. Our aim is to analyze this process when the underlying graph is the complete graph ...
Nicolas Broutin, Luc Devroye, Erin McLeish
ENDM
2010
110views more  ENDM 2010»
13 years 9 months ago
Modelling the Hop Constrained Connected Facility Location Problem on Layered Graphs
Gouveia et al. [3] show how to model the Hop Constrained Minimum Spanning tree problem as Steiner tree problem on a layered graph. Following their ideas, we provide three possibil...
Ivana Ljubic, Stefan Gollowitzer
CCCG
2003
13 years 10 months ago
Network Design Subject to Facility Location
We consider the problem of designing a transportation network to allow the residents of the network to avail service provided by a single facility whose location is predetermined....
Laxmi Gewali, Joy Bhadury, Ramaswamy Chandrasekara...