271 search results - page 6 / 55 » The lattice of embedded subsets |
STACS
2009
Springer
14 years 3 months ago
2009
Springer
We present the first polynomial-time approximation schemes (PTASes) for the following subset-connectivity problems in edge-weighted graphs of bounded genus: Steiner tree, low-conn...
NFM
2011
13 years 3 months ago
2011
Abstract. We present a new open source model checker, opaal, for automatic verification of models using lattice automata. Lattice automata allow the users to incorporate abstracti...
ORDER
2010
13 years 7 months ago
2010
Let P be the ordered set of isomorphism types of finite ordered sets (posets), where the ordering is by embeddability. We study first-order definability in this ordered set. We ...
NA
2008
13 years 9 months ago
2008
(A) The celebrated Gaussian quadrature formula on finite intervals tells us that the Gauss nodes are the zeros of the unique solution of an extremal problem. We announce recent re...
DBWORKSHOPS
1992
13 years 10 months ago
1992
Godin, R. and R. Missaoui, An incremental concept formation approach for learning from databases, Theoretical Computer Science 133 (1994) 3533385. This paper describes a concept f...