Sciweavers

966 search results - page 8 / 194
» Small Alliances in Graphs
Sort
View
BIRD
2008
Springer
141views Bioinformatics» more  BIRD 2008»
13 years 10 months ago
Nested q-Partial Graphs for Genetic Network Inference from "Small n, Large p" Microarray Data
Abstract. Gaussian graphical models are widely used to tackle the important and challenging problem of inferring genetic regulatory networks from expression data. These models have...
Kevin Kontos, Gianluca Bontempi
ISAAC
2005
Springer
135views Algorithms» more  ISAAC 2005»
14 years 2 months ago
Embedding Point Sets into Plane Graphs of Small Dilation
Let S be a set of points in the plane. What is the minimum possible dilation of all plane graphs that contain S? Even for a set S as simple as five points evenly placed on the ci...
Annette Ebbers-Baumann, Ansgar Grüne, Marek K...
ICDE
2005
IEEE
106views Database» more  ICDE 2005»
14 years 2 months ago
On Small World Graphs in Non-uniformly Distributed Key Spaces
In this paper we show that the topologies of most logarithmic-style P2P systems like Pastry, Tapestry or P-Grid resemble small-world graphs. Inspired by Kleinberg’s small-world ...
Sarunas Girdzijauskas, Anwitaman Datta, Karl Abere...
JCT
2011
90views more  JCT 2011»
13 years 3 months ago
Small subgraphs in random graphs and the power of multiple choices
The standard paradigm for online power of two choices problems in random graphs is the Achlioptas process. Here we consider the following natural generalization: Starting with G0 a...
Torsten Mütze, Reto Spöhel, Henning Thom...
ISAAC
2005
Springer
91views Algorithms» more  ISAAC 2005»
14 years 2 months ago
Sparse Geometric Graphs with Small Dilation
Given a set S of n points in RD , and an integer k such that 0 k < n, we show that a geometric graph with vertex set S, at most n − 1 + k edges, maximum degree five, and dila...
Boris Aronov, Mark de Berg, Otfried Cheong, Joachi...