267 search results - page 2 / 54 » Core Decomposition in Graphs: Concepts, Algorithms and Appli... |
STOC
2003
ACM
14 years 5 months ago
2003
ACM
CVPR
2010
IEEE
14 years 1 months ago
2010
IEEE
Graph cuts methods are at the core of many state-of-theart algorithms in computer vision due to their efficiency in computing globally optimal solutions. In this paper, we solve t...
WG
1998
Springer
13 years 9 months ago
1998
Springer
Hierarchical decompositions of graphs are interesting for algorithmic purposes. There are several types of hierarchical decompositions. Tree decompositions are the best known ones....
ESA
2005
Springer
13 years 10 months ago
2005
Springer
We introduce a new way to compute common intervals of K permutations based on a very simple and general notion of generators of common intervals. This formalism leads to simple an...
FLAIRS
2003
13 years 6 months ago
2003
Geo-referenced information is used by a growing number of “spatially-aware” tools in different application areas, including tourism, marketing, environmental management, and m...