72 search results - page 6 / 15 » Succinct Representations of Separable Graphs |
DAM
2007
15 years 1 months ago
2007
Given a graph G = (V, E) with a cost function c(S) ≥ 0 ∀S ⊆ V , we want to represent all possible min-cut values between pairs of vertices i and j. We consider also the spec...
106
click to vote
CONCUR
2008
Springer
15 years 3 months ago
2008
Springer
We consider imperfect-information parity games in which strategies rely on observations that provide imperfect information about the history of a play. To solve such games, i.e., t...
126
click to vote
AAAI
2010
15 years 2 months ago
2010
We consider optimizing the coalition structure in Coalitional Skill Games (CSGs), a succinct representation of coalitional games (Bachrach and Rosenschein 2008). In CSGs, the valu...
112
click to vote
COMBINATORICS
2007
15 years 1 months ago
2007
We investigate the notion of quantum chromatic number of a graph, which is the minimal number of colours necessary in a protocol in which two separated provers can convince a refe...
112
click to vote
GD
1998
Springer
15 years 5 months ago
1998
Springer
We describe a unified framework of aesthetic criteria and complexity measures for drawing planar graphs with polylines and curves. This framework includes several visual properties...