446 search results - page 11 / 90 » Extremal Stable Graphs |
131
click to vote
SAGT
2010
Springer
15 years 7 days ago
2010
Springer
We study the computational complexity of finding stable outcomes in symmetric additively-separable hedonic games. These coalition formation games are specified by an undirected e...
85
Voted
ICPR
2010
IEEE
15 years 6 months ago
2010
IEEE
We propose a novel method for the refinement of Maximally Stable Extremal Region (MSER) boundaries to sub-pixel precision by taking into account the intensity function in the 2
113
click to vote
DSN
2008
IEEE
15 years 8 months ago
2008
IEEE
We describe the implementation and experimental evaluation of a fault-tolerant leader election service for dynamic systems. Intuitively, distributed applications can use this serv...
112
Voted
ASPDAC
2008
ACM
15 years 3 months ago
2008
ACM
Nowadays a placement problem often involves multi-million objects and excessive fixed blockages. We present a new global placement algorithm that scales well to the modern large-s...
106
click to vote
ARSCOM
2005
15 years 1 months ago
2005
We investigate the supereulerian graph problems within planar graphs, and we prove that if a 2-edge-connected planar graph G is at most three edges short of having two edge-disjoi...