275 search results - page 23 / 55 » Parameterized Complexity of Generalized Vertex Cover Problem... |
119
click to vote
FOSSACS
2007
Springer
15 years 3 months ago
2007
Springer
In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of tempora...
104
click to vote
CISS
2008
IEEE
15 years 6 months ago
2008
IEEE
— In this paper, we present a distributed algorithm for detecting redundancies in a sensor network with no location information. We demonstrate how, in the absence of localizatio...
DAM
2006
14 years 11 months ago
2006
The Satisfactory Partition problem consists in deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neigh...
ALGORITHMICA
2004
14 years 11 months ago
2004
We apply and extend the priority algorithm framework introduced by Borodin, Nielsen, and Rackoff to define "greedy-like" algorithms for the (uncapacitated) facility locat...
103
click to vote
COMPGEOM
2010
ACM
15 years 4 months ago
2010
ACM
Normal surface theory is a central tool in algorithmic threedimensional topology, and the enumeration of vertex normal surfaces is the computational bottleneck in many important a...