267 search results - page 4 / 54 » Core Decomposition in Graphs: Concepts, Algorithms and Appli... |
RP
2010
Springer
13 years 3 months ago
2010
Springer
Efficient reachability query answering in large directed graphs has been intensively investigated because of its fundamental importance in many application fields such as XML data ...
GECCO
2006
Springer
13 years 9 months ago
2006
Springer
Various applications of spectral techniques for enhancing graph bisection in genetic algorithms are investigated. Several enhancements to a genetic algorithm for graph bisection a...
CORR
2010
Springer
13 years 3 months ago
2010
Springer
We present a general method of designing fast approximation algorithms for cut-based minimization problems in undirected graphs. In particular, we develop a technique that given a...
DAGSTUHL
2004
13 years 7 months ago
2004
Even sophisticated techniques start out from simple ideas. Later, in reply to application needs or theoretical problems new concepts are introduced and new formalisations proposed...
CVPR
2008
IEEE
14 years 7 months ago
2008
IEEE
We introduce a general formulation, called non-negative graph embedding, for non-negative data decomposition by integrating the characteristics of both intrinsic and penalty graph...