Sciweavers

1274 search results - page 124 / 255
» Graph lambda theories
Sort
View
JCT
2007
111views more  JCT 2007»
13 years 9 months ago
Removing even crossings
An edge in a drawing of a graph is called even if it intersects every other edge of the graph an even number of times. Pach and T´oth proved that a graph can always be redrawn so...
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stef...
IEEECIT
2010
IEEE
13 years 7 months ago
CFCSS without Aliasing for SPARC Architecture
With the increasing popularity of COTS (commercial off the shelf) components and multi-core processor in space and aviation applications, software fault tolerance becomes attracti...
Chao Wang, Zhongchuan Fu, Hongsong Chen, Wei Ba, B...
ICTAC
2004
Springer
14 years 2 months ago
Minimal Spanning Set for Coverage Testing of Interactive Systems
A model-based approach for minimization of test sets for interactive systems is introduced. Test cases are efficiently generated and selected to cover the behavioral model and the ...
Fevzi Belli, Christof J. Budnik
WG
2000
Springer
14 years 18 days ago
Budget Constrained Minimum Cost Connected Medians
Several practical instances of network design and location theory problems require the network to satisfy multiple constraints. In this paper, we address graph-theoretic problems t...
Goran Konjevod, Sven Oliver Krumke, Madhav V. Mara...
DAGSTUHL
2008
13 years 10 months ago
Constraint Satisfaction Problems with Infinite Templates
Allowing templates with infinite domains greatly expands the range of problems that can be formulated as a non-uniform constraint satisfaction problem. It turns out that many CSPs ...
Manuel Bodirsky