3008 search results - page 276 / 602 » Independence in connected graphs |
178
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We provide linear-time algorithms for geometric graphs with sublinearly many crossings. That is, we provide algorithms running in O(n) time on connected geometric graphs having n ...
176
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: Accurate prediction of intra-protein residue contacts from sequence information will allow the prediction of protein structures. Basic predictions of such specific con...
154
click to vote
CN
2007
15 years 6 months ago
2007
Web masters usually place certain web pages such as home pages and index pages in front of others. Under such a design, it is necessary to go through some pages to reach the desti...
196
click to vote
IJSNET
2007
15 years 6 months ago
2007
: Robustness and security of services like localisation, routing and time synchronisation in Wireless Sensor Networks (WSNs) have been critical issues. Efficient mathematical (gra...
168
click to vote
TPDS
2008
15 years 6 months ago
2008
This paper proposes a new methodology to model the distribution of finite size content to a group of users connected through an overlay network. Our methodology describes the distr...