1002 search results - page 120 / 201 » Towards Graph Programs for Graph Algorithms |
136
click to vote
SOCIALCOM
2010
15 years 2 months ago
2010
It is a widely held belief among designers of social tagging systems that tag clouds represent a useful tool for navigation. This is evident in, for example, the increasing number ...
141
click to vote
RECOMB
2003
Springer
16 years 4 months ago
2003
Springer
Genetic linkage analysis is a challenging application which requires Bayesian networks consisting of thousands of vertices. Consequently, computing the likelihood of data, which i...
166
Voted
STACS
2005
Springer
15 years 9 months ago
2005
Springer
Cycle covering is a well-studied problem in computer science. In this paper, we develop approximation algorithms for variants of cycle covering problems which bound the size and/o...
123
Voted
GPCE
2007
Springer
15 years 8 months ago
2007
Springer
Large scale software is composed of libraries produced by different entities. Non-intrusive and efficient mechanisms for adapting data structures from one library to conform to AP...
136
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
A spanner of an undirected unweighted graph is a subgraph that approximates the distance metric of the original graph with some specified accuracy. Specifically, we say H ⊆ G i...