3008 search results - page 267 / 602 » Independence in connected graphs |
169
click to vote
AIPS
2000
15 years 8 months ago
2000
Planners from the family of Graphplan (Graphplan, IPP, STAN...) are presently considered as the most efficient ones on numerous planning domains. Their partially ordered plans can...
207
click to vote
DCOSS
2010
Springer
15 years 10 months ago
2010
Springer
A number of protocols have been proposed to date to defend against wormhole attacks in wireless networks by adopting synchronized clocks, positioning devices, or directional antenn...
157
click to vote
DM
2006
15 years 6 months ago
2006
Berge's conjecture from 1982 on path partitions in directed graphs generalizes and extends Dilworth's Theorem and the Greene-Kleitman Theorem which are well known for pa...
141
click to vote
SIAMDM
2010
15 years 1 months ago
2010
Every 3-graph in which no four vertices are independent and no four vertices span precisely three edges must have edge density 4/9(1 - o(1)). This bound is tight. The proof is a r...
193
click to vote
NIPS
2003
15 years 8 months ago
2003
Spectral methods for nonlinear dimensionality reduction (NLDR) impose a neighborhood graph on point data and compute eigenfunctions of a quadratic form generated from the graph. W...