222 search results - page 11 / 45 » The Parameterized Complexity of Regular Subgraph Problems an... |
FOCS
2003
IEEE
14 years 23 days ago
2003
IEEE
We give a complexity theoretic classification of homomorphism problems for graphs and, more generally, relational structures obtained by restricting the left hand side structure ...
VIS
2008
IEEE
14 years 8 months ago
2008
IEEE
The Morse-Smale (MS) complex has proven to be a useful tool in extracting and visualizing features from scalar-valued data. However, efficient computation of the MS complex for lar...
STACS
2010
Springer
14 years 18 days ago
2010
Springer
Abstract. In the constraint satisfaction problem (CSP), the aim is to find an assignment of values to a set of variables subject to specified constraints. In the minimum cost hom...
CSMR
1998
IEEE
13 years 11 months ago
1998
IEEE
While it is widely agreed that architectural simplicity is a key factor to the success of large software systems, it is not obvious how to measure architectural complexity. Our ap...
LATA
2010
Springer
14 years 4 months ago
2010
Springer
Abstract. Iterated schemata allow to define infinite languages of propositional formulae through formulae patterns. Formally, schemata extend propositional logic with new (generali...