55 search results - page 7 / 11 » stacs 2010 |
STACS
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. The problem of Subgraph Isomorphism is defined as follows: Given a pattern H and a host graph G on n vertices, does G contain a subgraph that is isomorphic to H? Eppstei...
STACS
2010
Springer
14 years 2 months ago
2010
Springer
In this paper we consider the problem of testing whether two finite groups are isomorphic. Whereas the case where both groups are abelian is well understood and can be solved effi...
STACS
2010
Springer
14 years 17 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...
STACS
2010
Springer
14 years 2 months ago
2010
Springer
We study the online clustering problem where data items arrive in an online fashion. The algorithm maintains a clustering of data items into similarity classes. Upon arrival of v, ...
STACS
2010
Springer
14 years 2 months ago
2010
Springer
We call a CNF formula linear if any two clauses have at most one variable in common. We show that there exist unsatisfiable linear k-CNF formulas with at most 4k2 4k clauses, and ...