5889 search results - page 204 / 1178 » Graph Layout Problems |
170
click to vote
ICALP
2003
Springer
16 years 4 days ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
166
click to vote
COCO
2007
Springer
16 years 1 months ago
2007
Springer
We make progress in understanding the complexity of the graph reachability problem in the context of unambiguous logarithmic space computation; a restricted form of nondeterminism....
177
click to vote
ESCAPE
2007
Springer
15 years 10 months ago
2007
Springer
In the NP-hard Cluster Editing problem, we have as input an undirected graph G and an integer k 0. The question is whether we can transform G, by inserting and deleting at most k ...
181
click to vote
JMLR
2006
15 years 6 months ago
2006
We discuss the problem of learning to rank labels from a real valued feedback associated with each label. We cast the feedback as a preferences graph where the nodes of the graph ...
179
click to vote
FOCS
2007
IEEE
16 years 1 months ago
2007
IEEE
Consider a collection of random variables attached to the vertices of a graph. The reconstruction problem requires to estimate one of them given ‘far away’ observations. Sever...