Sciweavers

1986 search results - page 184 / 398
» Path Separability of Graphs
Sort
View
ANOR
2004
170views more  ANOR 2004»
13 years 10 months ago
Graph Coloring for Air Traffic Flow Management
The aim of Air Traffic Flow Management (ATFM) is to enhance the capacity of the airspace while satisfying Air Traffic Control constraints and airlines requests to optimize their o...
Nicolas Barnier, Pascal Brisset
TIT
2010
138views Education» more  TIT 2010»
13 years 4 months ago
Functional compression through graph coloring
Motivated by applications to sensor networks and privacy preserving databases, we consider the problem of functional compression. The objective is to separately compress possibly c...
Vishal Doshi, Devavrat Shah, Muriel Médard,...
COMPGEOM
2003
ACM
14 years 3 months ago
Finding a curve in a map
Given a polygonal curve and a geometric graph, we describe an efficient algorithm to find a path in the graph which is most similar to the curve, using the well-known Fr´echet d...
Carola Wenk, Helmut Alt, Alon Efrat, Lingeshwaran ...
EDM
2008
113views Data Mining» more  EDM 2008»
13 years 11 months ago
Mining and Visualizing Visited Trails in Web-Based Educational Systems
A data mining and visualization tool for the discovery of student trails in web-based educational systems is presented and described. The tool uses graphs to visualize results, all...
Cristóbal Romero, Sergio Gutiérrez S...
DAM
2008
78views more  DAM 2008»
13 years 10 months ago
Semi-preemptive routing on trees
We study a variant of the pickup-and-delivery problem (PDP) in which the objects that have to be transported can be reloaded at most d times, for a given d N. This problem is kno...
Sven Oliver Krumke, Dirk Räbiger, Rainer Schr...