Sciweavers

406 search results - page 25 / 82
» Dominating Sets in Web Graphs
Sort
View
ICDCS
2002
IEEE
15 years 8 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
MP
2006
81views more  MP 2006»
15 years 3 months ago
Almost all webs are not rank-perfect
Graphs with circular symmetry, called webs, are relevant w.r.t. describing the stable set polytopes of two larger graph classes, quasi-line graphs [8,12] and claw-free graphs [7,8]...
Arnaud Pêcher, Annegret Wagler
LICS
2007
IEEE
15 years 9 months ago
Locally Excluding a Minor
We introduce the concept of locally excluded minors. Graph classes locally excluding a minor are a common generalisation of the concept of excluded minor classes and of graph clas...
Anuj Dawar, Martin Grohe, Stephan Kreutzer
118
Voted
APPROX
2007
Springer
115views Algorithms» more  APPROX 2007»
15 years 9 months ago
Improved Approximation Algorithms for the Spanning Star Forest Problem
A star graph is a tree of diameter at most two. A star forest is a graph that consists of node-disjoint star graphs. In the spanning star forest problem, given an unweighted graph ...
Ning Chen, Roee Engelberg, C. Thach Nguyen, Prasad...
115
Voted
ICPR
2010
IEEE
15 years 1 months ago
Enhancing Web Page Classification via Local Co-training
Abstract--In this paper we propose a new multi-view semisupervised learning algorithm called Local Co-Training (LCT). The proposed algorithm employs a set of local models with vect...
Youtian Du, Xiaohong Guan, Zhongmin Cai