3008 search results - page 9 / 602 » Independence in connected graphs |
SIAMCOMP
1998
14 years 11 months ago
1998
This paper first presents a unified approach to design efficient algorithms for the weighted domination problem and its three variants, i.e., the weighted independent, connected,...
SODA
2010
ACM
15 years 9 months ago
2010
ACM
A Random Geometric Graph (RGG) in two dimensions is constructed by distributing n nodes independently and uniformly at random in [0, n ]2 and creating edges between every pair of...
SWAT
2000
Springer
15 years 3 months ago
2000
Springer
174
Voted
MLQ
2011
14 years 6 months ago
2011
Given a graph G whose set of vertices is a Polish space X, the weak Borel chromatic number of G is the least size of a family of pairwise disjoint G-independent Borel sets that cov...
141
click to vote
ACRI
2010
Springer
14 years 8 months ago
2010
Springer
This paper investigates the behaviors and the properties of a "Give and Take" cellular automaton on a graph. Using an economical metaphor, this model implements the excha...