Sciweavers

723 search results - page 6 / 145
» On the hyperbolicity constant in graphs
Sort
View
ICIP
2007
IEEE
15 years 6 months ago
Classification by Cheeger Constant Regularization
This paper develops a classification algorithm in the framework of spectral graph theory where the underlying manifold of a high dimensional data set is described by a graph. The...
Hsun-Hsien Chang, José M. F. Moura
ICDE
2006
IEEE
232views Database» more  ICDE 2006»
16 years 1 months ago
Dual Labeling: Answering Graph Reachability Queries in Constant Time
Graph reachability is fundamental to a wide range of applications, including XML indexing, geographic navigation, Internet routing, ontology queries based on RDF/OWL, etc. Many ap...
Haixun Wang, Hao He, Jeffrey Xu Yu, Jun Yang 0001,...
PROPERTYTESTING
2010
14 years 9 months ago
On Constant Time Approximation of Parameters of Bounded Degree Graphs
How well can the maximum size of an independent set, or the minimum size of a dominating set of a graph in which all degrees are at most d be approximated by a randomized constant...
Noga Alon
INFOCOM
2005
IEEE
15 years 5 months ago
FISSIONE: a scalable constant degree and low congestion DHT scheme based on Kautz graphs
Abstract— The distributed hash table (DHT) scheme has become the core component of many large-scale peer-to-peer networks. Degree, diameter, and congestion are important measures...
Dongsheng Li, Xicheng Lu, Jie Wu
STOC
2003
ACM
119views Algorithms» more  STOC 2003»
15 years 12 months ago
Constant factor approximation of vertex-cuts in planar graphs
Eyal Amir, Robert Krauthgamer, Satish Rao