Sciweavers

3267 search results - page 34 / 654
» Generalized quasirandom graphs
Sort
View
CCCG
2010
13 years 8 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
COMBINATORICS
2006
140views more  COMBINATORICS 2006»
13 years 7 months ago
Characterization of [1, k]-Bar Visibility Trees
A unit bar-visibility graph is a graph whose vertices can be represented in the plane by disjoint horizontal unit-length bars such that two vertices are adjacent if and only if th...
Guantao Chen, Joan P. Hutchinson, Ken Keating, Jia...
CORR
2012
Springer
230views Education» more  CORR 2012»
12 years 3 months ago
Fast Triangle Counting through Wedge Sampling
Graphs and networks are used to model interactions in a variety of contexts, and there is a growing need to be able to quickly assess the qualities of a graph in order to understa...
C. Seshadhri, Ali Pinar, Tamara G. Kolda
JDA
2010
122views more  JDA 2010»
13 years 2 months ago
Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs
We present subexponential parameterized algorithms on planar graphs for a family of problems of the following shape: given a graph, find a connected (induced) subgraph with bounde...
Ignasi Sau, Dimitrios M. Thilikos
GBRPR
2005
Springer
14 years 28 days ago
Pyramids of n-Dimensional Generalized Maps
Graph pyramids are often used for representing irregular image pyramids. For the 2D case, combinatorial pyramids have been recently defined in order to explicitly represent more ...
Carine Grasset-Simon, Guillaume Damiand, Pascal Li...