5473 search results - page 636 / 1095 » On the graph isomorphism problem |
180
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
In this paper we consider the problem of reconstructing a hidden weighted
hypergraph of constant rank using additive queries. We prove the following: Let G be
a weighted hidden h...
164
click to vote
IWPEC
2009
Springer
16 years 1 months ago
2009
Springer
The bandwidth of a graph G on n vertices is the minimum b such that the vertices of G can be labeled from 1 to n such that the labels of every pair of adjacent vertices differ by ...
157
click to vote
AAIM
2007
Springer
16 years 1 months ago
2007
Springer
The Generalized Maximum Dispersion problem asks for a partition of a given graph into p vertex-disjoint sets, each of them having at most k vertices. The goal is to maximize the to...
178
click to vote
APPROX
2005
Springer
16 years 13 days ago
2005
Springer
Optimal dispersers have better dependence on the error than optimal extractors. In this paper we give explicit disperser constructions that beat the best possible extractors in so...
213
click to vote
ASP
2005
Springer
16 years 13 days ago
2005
Springer
A new exact algorithm for computing answer sets of logic programs is presented and analyzed. The algorithm takes a logic program in Kernel normal form as an input and computes its ...