Sciweavers

736 search results - page 21 / 148
» Distinguishing geometric graphs
Sort
View
APVIS
2004
13 years 10 months ago
Adding Filtering to Geometric Distortion to Visualize a Clustered Graph on Small Screens.
Presenting large amounts of information in a limited screen space is a significant challenge in the field of Information Visualization. With the rapid development and growing use ...
Wanchun Li, Masahiro Takatsuka
SODA
2010
ACM
201views Algorithms» more  SODA 2010»
14 years 5 months ago
Efficient Broadcast on Random Geometric Graphs
A Random Geometric Graph (RGG) in two dimensions is constructed by distributing n nodes independently and uniformly at random in [0, n ]2 and creating edges between every pair of...
Milan Bradonji, Robert Elsässer, Tobias Friedrich...
COMBINATORICA
2011
12 years 8 months ago
On the chromatic number of random geometric graphs
Given independent random points X1, . . . , Xn ∈ Rd with common probability distribution ν, and a positive distance r = r(n) > 0, we construct a random geometric graph Gn wi...
Colin McDiarmid, Tobias Müller
CCCG
2010
13 years 10 months ago
Approximating the independent domatic partition problem in random geometric graphs - an experimental study
We investigate experimentally the Domatic Partition (DP) problem, the Independent Domatic Partition (IDP) problem and the Idomatic partition problem in Random Geometric Graphs (RG...
Dhia Mahjoub, Angelika Leskovskaya, David W. Matul...
CP
2009
Springer
14 years 9 months ago
Constraint-Based Optimal Testing Using DNNF Graphs
The goal of testing is to distinguish between a number of hypotheses about a systemfor example, dierent diagnoses of faults by applying input patterns and verifying or falsifying t...
Anika Schumann, Martin Sachenbacher, Jinbo Huang