2877 search results - page 10 / 576 » The Complexity of Planarity Testing |
ISOLA
2004
Springer
14 years 1 months ago
2004
Springer
The article is concerned with an approach to model based test development for large software systems. The approach presented is a part of UniTesK test development technology, which...
DAGSTUHL
2006
13 years 9 months ago
2006
We show that Kolmogorov complexity and such its estimators as universal codes (or data compression methods) can be applied for hypothesis testing in a framework of classical mathe...
CCCG
2010
13 years 9 months ago
2010
We explore which polyhedra and polyhedral complexes can be formed by folding up a planar polygonal region and fastening it with one zipper. We call the reverse process a zipper un...
STACS
2001
Springer
14 years 3 days ago
2001
Springer
Langton’s ant is a simple discrete dynamical system, with a surprisingly complex behavior. We study its extension to general planar graphs. First we give some relations between c...
DAM
1999
13 years 7 months ago
1999
The definitions of four previously studied parameters related to total coverings and total matchings of graphs can be restricted, thereby obtaining eight parameters related to cov...