Sciweavers

736 search results - page 6 / 148
» Distinguishing geometric graphs
Sort
View
CCCG
2010
13 years 10 months ago
Stable roommates and geometric spanners
In this paper we devise a new geometric spanner based on a generalization of the known Stable Roommates algorithm. This spanner is on the "path" between the Yao graph an...
Paz Carmi, Lilach Chaitman
BMCBI
2007
162views more  BMCBI 2007»
13 years 8 months ago
Three-Dimensional Phylogeny Explorer: Distinguishing paralogs, lateral transfer, and violation of "molecular clock" assumption w
Background: Construction and interpretation of phylogenetic trees has been a major research topic for understanding the evolution of genes. Increases in sequence data and complexi...
Namshin Kim, Christopher Lee
CCCG
2004
13 years 9 months ago
Local properties of geometric graphs
We propose a definition of locality for properties of geometric graphs. We measure the local density of graphs using region-counting distances [8] between pairs of vertices, and w...
Jean Cardinal, Sébastien Collette, Stefan L...
EUSFLAT
2001
13 years 9 months ago
A geometric approach to aggregation
In analogy to the representation of the standard probabilistic average as an expected value of a random variable, a geometric approach to aggregation is proposed. Several properti...
Erich-Peter Klement, Radko Mesiar, Endre Pap
WAW
2007
Springer
122views Algorithms» more  WAW 2007»
14 years 2 months ago
A Geometric Preferential Attachment Model of Networks II
We study a random graph Gn that combines certain aspects of geometric random graphs and preferential attachment graphs. This model yields a graph with power-law degree distributio...
Abraham D. Flaxman, Alan M. Frieze, Juan Vera