15254 search results - page 317 / 3051 » A k |
133
Voted
GI
2007
Springer
15 years 10 months ago
2007
Springer
Abstract: Zur elektronischen Identifikation von Einzeltieren mit Hilfe von LFTranspondern (134,2 kHz) sind f
148
click to vote
ALGORITHMICA
2010
15 years 7 months ago
2010
It is known to be NP-hard to decide whether a graph can be made chordal by the deletion of k vertices or by the deletion of k edges. Here we present a uniformly polynomial-time alg...
166
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
The packing chromatic number (G) of a graph G is the least integer k for which there exists a mapping f from V (G) to {1, 2, . . ., k} such that any two vertices of color i
177
Voted
CORR
2008
Springer
15 years 6 months ago
2008
Springer
In this work we suggest a new model for generating random satisfiable k-CNF formulas. To generate such formulas