Sciweavers

1127 search results - page 19 / 226
» Testing the Expansion of a Graph
Sort
View
FSTTCS
2009
Springer
14 years 5 months ago
Domination Problems in Nowhere-Dense Classes
We investigate the parameterized complexity of generalisations and variations of the dominating set problem on classes of graphs that are nowhere dense. In particular, we show that...
Anuj Dawar, Stephan Kreutzer
COMBINATORICS
2007
105views more  COMBINATORICS 2007»
13 years 11 months ago
A Two Parameter Chromatic Symmetric Function
We introduce and develop a two-parameter chromatic symmetric function for a simple graph G over the field of rational functions in q and t , Q (q, t). We derive its expansion in ...
Ellison-Anne Williams
DATE
2002
IEEE
80views Hardware» more  DATE 2002»
14 years 3 months ago
Test Planning and Design Space Exploration in a Core-Based Environment
This paper proposes a comprehensive model for test planning in a core-based environment. The main contribution of this work is the use of several types of TAMs and the considerati...
Érika F. Cota, Luigi Carro, Marcelo Lubasze...
PAMI
2010
139views more  PAMI 2010»
13 years 9 months ago
Order-Preserving Moves for Graph-Cut-Based Optimization
— In the last decade, graph-cut optimization has been popular for a variety of labeling problems. Typically graph-cut methods are used to incorporate smoothness constraints on a ...
Xiaoqing Liu, Olga Veksler, Jagath Samarabandu