JACM
2010
13 years 6 months ago
2010
A schema mapping is a specification that describes how data structured under one schema (the source schema) is to be transformed into data structured under a different schema (the...
JACIII
2010
13 years 6 months ago
2010
IWOCA
2010
Springer
13 years 6 months ago
2010
Springer
In this paper we obtain parameterized subexponential-time algorithms for p-Kemeny Aggregation (p-KAGG) -- a problem in social choice theory -- and for p-One-Sided Crossing Minimiza...
IWOCA
2010
Springer
13 years 6 months ago
2010
Springer
We consider here the problem of chaining seeds in ordered trees. Seeds are mappings between two trees Q and T and a chain is a subset of non overlapping seeds that is consistent wi...
IWOCA
2010
Springer
13 years 6 months ago
2010
Springer
A homomorphism from a graph G to a graph R is locally surjective if its restriction to the neighborhood of each vertex of G is surjective. Such a homomorphism is also called an R-r...
IWOCA
2010
Springer
13 years 6 months ago
2010
Springer
IWOCA
2010
Springer
13 years 6 months ago
2010
Springer
IWOCA
2010
Springer
13 years 6 months ago
2010
Springer
A path-based support of a hypergraph H is a graph with the same vertex set as H in which each hyperedge induces a Hamiltonian subgraph. While it is NP-complete to compute a path-ba...
IWOCA
2010
Springer
13 years 6 months ago
2010
Springer
The maximum independent set problem is NP-complete for graphs in general, but becomes solvable in polynomial time when restricted to graphs in many special classes. The problem is ...
IJSIR
2010
13 years 6 months ago
2010
It is known that the most common versions of particle swarm optimization (PSO) algorithms are rotationally variant. It has also been pointed out that PSO algorithms can concentrat...