4865 search results - page 215 / 973 » The Complexity of Graph Connectivity |
131
click to vote
ICLP
1997
Springer
15 years 8 months ago
1997
Springer
Kowalski and Sergot’s Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which propert...
132
click to vote
MST
2007
15 years 3 months ago
2007
Important variants of the Vertex Cover problem (among others, Connected Vertex Cover, Capacitated Vertex Cover, and Maximum Partial Vertex Cover) have been intensively studied in ...
160
Voted
AUTONOMICS
2008
ACM
15 years 5 months ago
2008
ACM
Ubiquitous computing and communication environments connect systems and people in unprecedented ways, but also fundamentally challenge the mindset of traditional systems engineeri...
123
click to vote
ESWS
2010
Springer
15 years 8 months ago
2010
Springer
The sizes of datasets available as RDF (e.g., as part of the Linked Data cloud) are increasing continuously. For instance, the recent DBpedia version consists of nearly 500 million...
157
click to vote
BIRTHDAY
2010
Springer
15 years 5 months ago
2010
Springer
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...