3008 search results - page 110 / 602 » Independence in connected graphs |
166
click to vote
DAM
2010
15 years 6 months ago
2010
We study P6-free graphs, i.e., graphs that do not contain an induced path on six vertices. Our main result is a new characterization of this graph class: a graph G is P6-free if an...
149
click to vote
DM
2008
15 years 6 months ago
2008
A simple graph G is k-ordered (respectively, k-ordered hamiltonian) if, for any sequence of k distinct vertices v1, . . . , vk of G, there exists a cycle (respectively, a hamilton...
144
click to vote
OPODIS
2007
15 years 7 months ago
2007
Abstract. Blin et al. (2006) proposed a distributed protocol that enables the smallest number of searchers to clear any unknown asynchronous graph in a decentralized manner. Unknow...
186
click to vote
JDWM
2010
15 years 4 months ago
2010
Social networks and collaborative tagging systems are rapidly gaining popularity as a primary means for storing and sharing data among friends, family, colleagues, or perfect stra...
163
click to vote
ICPR
2000
IEEE
16 years 7 months ago
2000
IEEE
An important theoretical tool in machine learning is the bias/variance decomposition of the generalization error. It was introduced for the mean square error in [3]. The bias/vari...