829 search results - page 109 / 166 » Distance domination-critical graphs |
104
click to vote
JITECH
2010
14 years 10 months ago
2010
This paper employs the network perspective to study patterns and structures of intraorganizational learning networks. The theoretical background draws from cognitive theories, the...
JCSS
2011
14 years 6 months ago
2011
The bandwidth of an n-vertex graph G is the minimum value b such that the vertices of G can be mapped to distinct integer points on a line without any edge being stretched to a di...
107
click to vote
PVLDB
2010
14 years 6 months ago
2010
With the increasing deployment and use of GPS-enabled devices, massive amounts of GPS data are becoming available. We propose a general framework for the mining of semantically me...
TSP
2010
14 years 6 months ago
2010
The problem of learning tree-structured Gaussian graphical models from independent and identically distributed (i.i.d.) samples is considered. The influence of the tree structure a...
115
click to vote
CCCG
2010
15 years 1 months ago
2010
We propose algorithms for efficiently maintaining a constant-approximate minimum connected dominating set (MCDS) of a geometric graph under node insertions and deletions. Assuming...