2125 search results - page 115 / 425 » On Graph Complexity |
132
click to vote
STACS
1992
Springer
15 years 6 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...
117
click to vote
TMC
2008
15 years 2 months ago
2008
We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a...
130
Voted
WAIM
2010
Springer
15 years 23 days ago
2010
Springer
In this paper we propose a generic model to generate basic multi-partite graphs obtained by associations found in arbitrary data. The interest of such a model is to be the formal ...
109
Voted
ACSD
2006
IEEE
15 years 8 months ago
2006
IEEE
Synchronous Data Flow Graphs (SDFGs) are a useful tool for modeling and analyzing embedded data flow applications, both in a single processor and a multiprocessing context or for...
ESA
2008
Springer
15 years 4 months ago
2008
Springer
We consider a planning problem that generalizes Alcuin's river crossing problem (also known as: The wolf, goat, and cabbage puzzle) to scenarios with arbitrary conflict graph...