Sciweavers

6740 search results - page 151 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
ML
2010
ACM
185views Machine Learning» more  ML 2010»
13 years 5 months ago
Learning to rank on graphs
Graph representations of data are increasingly common. Such representations arise in a variety of applications, including computational biology, social network analysis, web applic...
Shivani Agarwal
PODS
2004
ACM
96views Database» more  PODS 2004»
14 years 10 months ago
Roads, Codes and Spatiotemporal Queries
We present a novel coding-based technique for answering spatial and spatiotemporal queries on objects moving along a system of curves on the plane such as many road networks. We h...
Sandeep Gupta, Swastik Kopparty, Chinya V. Ravisha...
GD
2005
Springer
14 years 3 months ago
A Mixed-Integer Program for Drawing High-Quality Metro Maps
In this paper we investigate the problem of drawing metro maps which is defined as follows. Given a planar graph G of maximum degree 8 with its embedding and vertex locations (e.g...
Martin Nöllenburg, Alexander Wolff
CONEXT
2010
ACM
13 years 8 months ago
Assessing the vulnerability of replicated network services
Client-server networks are pervasive, fundamental, and include such key networks as the Internet, power grids, and road networks. In a client-server network, clients obtain a serv...
George Dean Bissias, Brian Neil Levine, Ramesh K. ...
APPROX
2007
Springer
100views Algorithms» more  APPROX 2007»
14 years 4 months ago
Implementing Huge Sparse Random Graphs
Consider a scenario where one desires to simulate the execution of some graph algorithm on random input graphs of huge, perhaps even exponential size. Sampling and storing these h...
Moni Naor, Asaf Nussboim