356 search results - page 4 / 72 » A Most General Edge Elimination Polynomial - Thickening of E... |
139
click to vote
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
We consider graphical games in which edges are zero-sum games between the endpoints/players; the payoff of a player is the sum of the payoffs from each incident edge. We give a si...
105
Voted
WAOA
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. We consider a Stackelberg pricing problem in directed networks. Tariffs have to be defined by an operator, the leader, for a subset of the arcs, the tariff arcs. Clien...
DM
2008
15 years 1 months ago
2008
It is proved that edges of a graph G with no component K2 can be coloured using at most 2 log2 (G) + 1 colours so that any two adjacent vertices have distinct sets of colours of t...
109
Voted
IVC
2000
15 years 1 months ago
2000
This paper presents a novel automatic method for view synthesis (or image transfer) from a triplet of uncalibrated images based on trinocular edge matching followed by transfer by...
COCOON
2006
Springer
15 years 5 months ago
2006
Springer
We examine how to induce selfish heterogeneous users in a multicommodity network to reach an equilibrium that minimizes the social cost. In the absence of centralized coordination...