Sciweavers

3 search results - page 1 / 1
» Grad and classes with bounded expansion II. Algorithmic aspe...
Sort
View
EJC
2008
13 years 11 months ago
Grad and classes with bounded expansion II. Algorithmic aspects
Abstract. Classes of graphs with bounded expansion are a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, t...
Jaroslav Nesetril, Patrice Ossona de Mendez
SODA
2003
ACM
158views Algorithms» more  SODA 2003»
14 years 16 days ago
Comparing top k lists
Motivated by several applications, we introduce various distance measures between “top k lists.” Some of these distance measures are metrics, while others are not. For each of...
Ronald Fagin, Ravi Kumar, D. Sivakumar
KI
2006
Springer
13 years 11 months ago
A Framework for Quasi-exact Optimization Using Relaxed Best-First Search
Abstract. In this paper, a framework for previous and new quasi-exact extensions of the A -algorithm is presented. In contrast to previous approaches, the new methods guarantee to ...
Rüdiger Ebendt, Rolf Drechsler