3008 search results - page 204 / 602 » Independence in connected graphs |
167
click to vote
STOC
2001
ACM
16 years 6 months ago
2001
ACM
We show that we can maintain up to polylogarithmic edge connectivity for a fully-dynamic graph in ~O(pn) time per edge insertion or deletion. Within logarithmic factors, this matc...
187
click to vote
INFOCOM
2003
IEEE
15 years 12 months ago
2003
IEEE
— A Mobile Ad hoc Network (MANET) is a collection of wireless mobile nodes forming a temporary network without using any existing infrastructure. Since not many MANETs are curren...
176
click to vote
KCAP
2009
ACM
15 years 11 months ago
2009
ACM
Ontology modularization has received growing interest from the research community lately, since it supports tasks such as ontology design/reuse and knowledge selection and integra...
190
click to vote
BMCBI
2005
15 years 6 months ago
2005
Background: Several problems exist with current methods used to align DNA sequences for comparative sequence analysis. Most dynamic programming algorithms assume that conserved se...
350
click to vote
CSL
2011
Springer
15 years 1 months ago
2011
Springer
How much can we infer about the pronunciation of a language – past or present – by observing which words its speakers rhyme? This paper explores the connection between pronunc...