803 search results - page 56 / 161 » Independence in Direct-Product Graphs |
103
click to vote
APPROX
2004
Springer
15 years 6 months ago
2004
Springer
While it is exponentially unlikely that a sparse random graph or hypergraph is connected, with probability 1 − o(1) such a graph has a “giant component” that, given its numbe...
113
Voted
CHI
2010
ACM
15 years 5 months ago
2010
ACM
We present a tangible user interface (TUI) called Tangible Graph Builder, that has been designed to allow visually impaired users to access graph and chart-based data. We describe...
116
click to vote
ICPP
1999
IEEE
15 years 5 months ago
1999
IEEE
Task graph scheduling has been found effective in performance prediction and optimization of parallel applications. A number of static scheduling algorithms have been proposed for...
109
Voted
GECCO
2009
Springer
15 years 5 months ago
2009
Springer
We propose a cooperative-coevolution – Parisian trend – algorithm, IMPEA (Independence Model based Parisian EA), to the problem of Bayesian networks structure estimation. It i...
96
Voted
LICS
2007
IEEE
15 years 7 months ago
2007
IEEE
We introduce the concept of locally excluded minors. Graph classes locally excluding a minor are a common generalisation of the concept of excluded minor classes and of graph clas...