Sciweavers

3757 search results - page 300 / 752
» The overlap number of a graph
Sort
View
180
Voted
CORR
2010
Springer
168views Education» more  CORR 2010»
15 years 4 months ago
Bounds on the maximum multiplicity of some common geometric graphs
We obtain new lower and upper bounds for the maximum multiplicity of some weighted and, respectively, non-weighted common geometric graphs drawn on n points in the plane in genera...
Adrian Dumitrescu, André Schulz, Adam Sheff...
COLING
2010
15 years 1 months ago
A Linguistically Grounded Graph Model for Bilingual Lexicon Extraction
We present a new method, based on graph theory, for bilingual lexicon extraction without relying on resources with limited availability like parallel corpora. The graphs we use re...
Florian Laws, Lukas Michelbacher, Beate Dorow, Chr...
CP
2009
Springer
16 years 7 months ago
Exploiting Problem Structure for Solution Counting
This paper deals with the challenging problem of counting the number of solutions of a CSP, denoted #CSP. Recent progress have been made using search methods, such as BTD [15], whi...
Aurélie Favier, Philippe Jégou, Simo...
JAL
2006
175views more  JAL 2006»
15 years 6 months ago
Approximations for minimum and min-max vehicle routing problems
: We consider a variety of vehicle routing problems. The input to a problem consists of a graph G = (N, E) and edge lengths l(e) e E. Customers located at the vertices have to be ...
Esther M. Arkin, Refael Hassin, Asaf Levin
TCS
2008
15 years 6 months ago
Cleaning a network with brushes
Following the decontamination metaphor for searching a graph, we introduce a cleaning process, which is related to both the chip-firing game and edge searching. Brushes (instead o...
Margaret-Ellen Messinger, Richard J. Nowakowski, P...