260 search results - page 18 / 52 » Resolution Complexity of Independent Sets in Random Graphs |
CAV
2008
Springer
13 years 9 months ago
2008
Springer
Hangal et. al. [3] have developed a procedure to check if an instance of the execution of a shared memory multiprocessor program, is consistent with the Total Store Order (TSO) mem...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
Abstract. We consider in this paper the problem of discovering, via a traceroute algorithm, the topology of a network, whose graph is spanned by an infinite branching process. A s...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...
COCOON
2000
Springer
13 years 11 months ago
2000
Springer
We consider the parameterized complexity of the following problem under the framework introduced by Downey and Fellows[4]: Given a graph G, an integer parameter k and a non-trivial...
FCS
2009
13 years 5 months ago
2009
- A representation for a set is defined to be symmetric if the space required for the representation of the set is the same as the space required for representation of the set'...