7 search results - page 1 / 2 » iwoca 2010 |
IWOCA
2010
Springer
13 years 4 months ago
2010
Springer
IWOCA
2010
Springer
13 years 4 months ago
2010
Springer
IWOCA
2010
Springer
13 years 4 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 4 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 4 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 ...