Sciweavers

723 search results - page 25 / 145
» On the hyperbolicity constant in graphs
Sort
View
DM
2008
116views more  DM 2008»
15 years 5 months ago
Breaking the rhythm on graphs
We study graph colorings avoiding periodic sequences with large number of blocks on paths. The main problem is to decide, for a given class of graphs F, if there are absolute const...
Noga Alon, Jaroslaw Grytczuk
OL
2010
140views more  OL 2010»
15 years 28 days ago
Approximation algorithms for finding and partitioning unit-disk graphs into co-k-plexes
This article studies a degree-bounded generalization of independent sets called co-k-plexes. Constant factor approximation algorithms are developed for the maximum co-k-plex probl...
Balabhaskar Balasundaram, Shyam Sundar Chandramoul...
PPOPP
2012
ACM
14 years 1 months ago
Better speedups using simpler parallel programming for graph connectivity and biconnectivity
Speedups demonstrated for finding the biconnected components of a graph: 9x to 33x on the Explicit Multi-Threading (XMT) many-core computing platform relative to the best serial ...
James A. Edwards, Uzi Vishkin
CPC
2006
92views more  CPC 2006»
15 years 6 months ago
Waiting for a Bat to Fly By (in Polynomial Time)
We observe returns of a simple random walk on a finite graph to a fixed node, and would like to infer properties of the graph, in particular properties of the spectrum of the trans...
Itai Benjamini, Gady Kozma, László L...
CORR
2006
Springer
151views Education» more  CORR 2006»
15 years 6 months ago
Graph Laplacians and their convergence on random neighborhood graphs
Given a sample from a probability measure with support on a submanifold in Euclidean space one can construct a neighborhood graph which can be seen as an approximation of the subm...
Matthias Hein, Jean-Yves Audibert, Ulrike von Luxb...