20 search results - page 3 / 4 » Bipartite Permutation Graphs Are Reconstructible |
DAGSTUHL
2006
13 years 7 months ago
2006
In this report paper we collect recent results on the vertex reconstruction in Cayley graphs Cay(G, S). The problem is stated as the problem of reconstructing a vertex from the mi...
WALCOM
2010
IEEE
13 years 4 months ago
2010
IEEE
WADS
2009
Springer
14 years 8 days ago
2009
Springer
Abstract. We introduce the simultaneous representation problem, defined for any graph class C characterized in terms of representations, e.g. any class of intersection graphs. Two...
ICALP
2005
Springer
13 years 11 months ago
2005
Springer
Given a graph G = (V, E) and positive integral vertex weights w : V → N, the max-coloring problem seeks to find a proper vertex coloring of G whose color classes C1, C2, . . . ,...
NIPS
2008
13 years 7 months ago
2008
Motivated by applications like elections, web-page ranking, revenue maximization etc., we consider the question of inferring popular rankings using constrained data. More specific...