Sciweavers

3267 search results - page 137 / 654
» Generalized quasirandom graphs
Sort
View
144
Voted
PC
2010
177views Management» more  PC 2010»
15 years 3 months ago
Parallel graph component labelling with GPUs and CUDA
Graph component labelling, which is a subset of the general graph colouring problem, is a computationally expensive operation that is of importance in many applications and simula...
Kenneth A. Hawick, Arno Leist, Daniel P. Playne
WDAG
2010
Springer
233views Algorithms» more  WDAG 2010»
15 years 2 months ago
Minimum Dominating Set Approximation in Graphs of Bounded Arboricity
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
Christoph Lenzen, Roger Wattenhofer
KDD
2007
ACM
154views Data Mining» more  KDD 2007»
16 years 5 months ago
An event-based framework for characterizing the evolutionary behavior of interaction graphs
Interaction graphs are ubiquitous in many fields such as bioinformatics, sociology and physical sciences. There have been many studies in the literature targeted at studying and m...
Sitaram Asur, Srinivasan Parthasarathy, Duygu Ucar
IWOCA
2009
Springer
104views Algorithms» more  IWOCA 2009»
15 years 11 months ago
An O(n)-Time Algorithm for the Paired-Domination Problem on Permutation Graphs
A vertex subset D of a graph G is a dominating set if every vertex of G is either in D or is adjacent to a vertex in D. The paired-domination problem on G asks for a minimum-cardi...
Evaggelos Lappas, Stavros D. Nikolopoulos, Leonida...
124
Voted
COMPGEOM
2009
ACM
15 years 11 months ago
On grids in topological graphs
A topological graph is a graph drawn in the plane with vertices represented by points and edges as arcs connecting its vertices. A k-grid in a topological graph is a pair of edge ...
Eyal Ackerman, Jacob Fox, János Pach, Andre...