4009 search results - page 293 / 802 » Clustering on Complex Graphs |
320
click to vote
ICDT
2009
ACM
16 years 7 months ago
2009
ACM
A technique called user views has recently been proposed to focus user attention on relevant information in response to provenance queries over workflow executions [1, 2]: Given u...
182
click to vote
ICSM
2005
IEEE
16 years 8 days ago
2005
IEEE
Clustering layouts of software systems combine two important aspects: they reveal groups of related artifacts of the software system, and they produce a visualization of the resul...
179
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
144
click to vote
ESA
2008
Springer
15 years 8 months ago
2008
Springer
We consider a planning problem that generalizes Alcuin's river crossing problem (also known as: The wolf, goat, and cabbage puzzle) to scenarios with arbitrary conflict graph...
177
click to vote
MST
2008
15 years 6 months ago
2008
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generaliz...