1461 search results - page 149 / 293 » Complexity of Graph Covering Problems |
153
click to vote
COCO
2009
Springer
16 years 22 days ago
2009
Springer
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...
183
Voted
APN
2007
Springer
16 years 10 days ago
2007
Springer
Abstract. We study data nets, a generalisation of Petri nets in which tokens carry data from linearlyordered infinite domains and in which whole-place operations such as resets an...
163
click to vote
PVLDB
2008
15 years 5 months ago
2008
The dependency propagation problem is to determine, given a view defined on data sources and a set of dependencies on the sources, whether another dependency is guaranteed to hold...
165
click to vote
FOCS
2009
IEEE
16 years 27 days ago
2009
IEEE
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
187
click to vote
CORR
2012
Springer
14 years 1 months ago
2012
Springer
In many information networks, data items – such as updates in social networks, news flowing through interconnected RSS feeds and blogs, measurements in sensor networks, route u...