2612 search results - page 159 / 523 » Switching Graphs and Their Complexity |
93
Voted
COCOON
2009
Springer
15 years 7 months ago
2009
Springer
We introduce overlap cluster graph modification problems where, other than in most previous work, the clusters of the target graph may overlap. More precisely, the studied graph p...
118
click to vote
CRV
2007
IEEE
15 years 7 months ago
2007
IEEE
This paper presents the design and implementation of a multi-resolution graph cuts (MRGC) for stereo-motion framework that produces dense disparity maps. Both stereo and motion ar...
112
click to vote
MFCS
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
122
click to vote
ALENEX
2003
15 years 2 months ago
2003
Graph models for real-world complex networks such as the Internet, the WWW and biological networks are necessary for analytic and simulation-based studies of network protocols, al...
121
Voted
WAIM
2010
Springer
14 years 11 months ago
2010
Springer
In this paper we propose a generic model to generate basic multi-partite graphs obtained by associations found in arbitrary data. The interest of such a model is to be the formal ...