2125 search results - page 91 / 425 » On Graph Complexity |
CASES
2009
ACM
13 years 5 months ago
2009
ACM
In this paper we address the issue of making a program reversible in terms of spatial complexity. Spatial complexity is the amount of memory/register locations required for perfor...
ESA
2007
Springer
14 years 1 months ago
2007
Springer
Given a graph G = (V, E), a (d, k)-coloring is a function from the vertices V to colors {1, 2, . . . , k} such that any two vertices within distance d of each other are assigned di...
WG
2010
Springer
13 years 6 months ago
2010
Springer
The vertex colouring problem is known to be NP-complete in the class of triangle-free graphs. Moreover, it remains NP-complete even if we additionally exclude a graph F which is n...
SIGIR
2006
ACM
14 years 1 months ago
2006
ACM
We present a novel framework for answering complex questions that relies on question decomposition. Complex questions are decomposed by a procedure that operates on a Markov chain...
FCT
2005
Springer
14 years 1 months ago
2005
Springer
We present several results on the complexity of various forms of Sperner’s Lemma in the black-box model of computing. We give a deterministic algorithm for Sperner problems over ...