Sciweavers

723 search results - page 46 / 145
» On the hyperbolicity constant in graphs
Sort
View
ALGORITHMICA
2007
86views more  ALGORITHMICA 2007»
15 years 6 months ago
Detecting Holes and Antiholes in Graphs
In this paper we study the problems of detecting holes and antiholes in general undirected graphs, and we present algorithms for these problems. For an input graph G on n vertices ...
Stavros D. Nikolopoulos, Leonidas Palios
SIAMDM
2010
170views more  SIAMDM 2010»
15 years 1 months ago
Complete Minors and Independence Number
Let G be a graph with n vertices and independence number . Hadwiger's conjecture implies that G contains a clique minor of order at least n/. In 1982, Duchet and Meyniel prov...
Jacob Fox
LICS
2009
IEEE
16 years 28 days ago
Pointer Programs and Undirected Reachability
Pointer programs are a model of structured computation within logspace. They capture the common description of logspace algorithms as programs that take as input some structured d...
Martin Hofmann, Ulrich Schöpp
ICDCS
2002
IEEE
15 years 11 months ago
Geometric Spanners for Wireless Ad Hoc Networks
Abstract—We propose a new geometric spanner for wireless ad hoc networks, which can be constructed efficiently in a distributed manner. It integrates the connected dominating se...
Yu Wang 0003, Xiang-Yang Li
TMI
2008
144views more  TMI 2008»
15 years 6 months ago
Automatic Detection of Regional Heart Rejection in USPIO-Enhanced MRI
Contrast-enhanced magnetic resonance imaging (MRI) is useful to study the infiltration of cells in vivo. This research adopts ultrasmall superparamagnetic iron oxide (USPIO) parti...
Hsun-Hsien Chang, José M. F. Moura, Yijen L...