127 search results - page 12 / 26 » Some Parameterized Problems On Digraphs |
JUCS
2008
14 years 11 months ago
2008
: This article provides a comparison among different methods for estimating the aggregation of Internet traffic resulting from different users, network-access types and correspondi...
117
click to vote
SODA
2010
ACM
14 years 10 months ago
2010
ACM
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
103
Voted
CDC
2009
IEEE
15 years 4 months ago
2009
IEEE
— The moment problem matured from its various special forms in the late 19th and early 20th Centuries to a general class of problems that continues to exert profound influence o...
STOC
2003
ACM
15 years 12 months ago
2003
ACM
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...
ALDT
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. We propose various models for lobbying in a probabilistic environment, in which an actor (called “The Lobby”) seeks to influence the voters’ preferences of voting ...