1461 search results - page 111 / 293 » Complexity of Graph Covering Problems |
101
click to vote
HCI
2007
14 years 11 months ago
2007
User interface (UI) plasticity denotes UI adaptation to the context of use (user, platform, physical and social environment) while preserving usability. Our approach to this proble...
WDAG
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. The distributed complexity of computing a maximal independent set in a graph is of both practical and theoretical importance. While there exists an elegant O(log n) time ...
PODS
1993
ACM
15 years 2 months ago
1993
ACM
In this paper we consider the problem of using disk blocks efficiently in searching graphs that are too large to fit in internal memory. Our model allows a vertex to be represented...
SPAA
2010
ACM
14 years 10 months ago
2010
ACM
We develop logarithmic approximation algorithms for extremely general formulations of multiprocessor multiinterval offline task scheduling to minimize power usage. Here each proce...
STACS
1992
Springer
15 years 2 months ago
1992
Springer
We show that the graph isomorphism problem is low for PP and for C=P, i.e., it does not provide a PP or C=P computation with any additional power when used as an oracle. Furthermor...