1322 search results - page 7 / 265 » Parameterized counting problems |
MIAR
2006
IEEE
14 years 1 months ago
2006
IEEE
Statistical shape modeling is widely used for medical image segmentation and interpretation. The main problem in building a shape model is the construction of a pointwise correspon...
DAM
2008
13 years 7 months ago
2008
We discuss different variants of linear arrangement problems from a parameterized perspective. More specifically, we concentrate on developing simple search tree algorithms for th...
AAAI
2008
13 years 9 months ago
2008
The study of random instances of NP complete and coNP complete problems has had much impact on our understanding of the nature of hard problems. In this work, we initiate an effor...
IWOCA
2010
Springer
13 years 2 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 ...
CATS
2008
13 years 9 months ago
2008
The problem of deciding whether the edge-set of a given graph can be partitioned into at most k cliques is well known to be NP-complete. In this paper we investigate this problem ...