359 search results - page 18 / 72 » The Parameterized Complexity of Counting Problems |
UC
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We study computational complexity of counting the fixed point configurations (FPs) in certain classes of graph automata viewed as discrete dynamical systems. We prove t...
ALGORITHMICA
2008
13 years 7 months ago
2008
The profile of a graph is an integer-valued parameter defined via vertex orderings; it is known that the profile of a graph equals the smallest number of edges of an interval supe...
SODA
2010
ACM
14 years 5 months ago
2010
ACM
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
MFCS
2004
Springer
14 years 27 days ago
2004
Springer
Abstract. Problem parameters are ubiquitous. In every area of computer science, we find all kinds of “special aspects” to the problems encountered. Hence, the study of paramet...
IPPS
2006
IEEE
14 years 1 months ago
2006
IEEE
In both distributed counting and queuing, processors in a distributed system issue operations which are organized into a total order. In counting, each processor receives the rank...