239 search results - page 29 / 48 » Hardness and algorithms for rainbow connection |
107
click to vote
ALENEX
2009
15 years 27 days ago
2009
A tanglegram is a pair of trees whose leaf sets are in oneto-one correspondence; matching leaves are connected by inter-tree edges. In applications such as phylogenetics or hierar...
JAIR
2007
14 years 11 months ago
2007
In this paper, we study the possibility of designing non-trivial random CSP models by exploiting the intrinsic connection between structures and typical-case hardness. We show tha...
WISEC
2009
ACM
15 years 6 months ago
2009
ACM
Time synchronization in highly distributed wireless systems like sensor and ad hoc networks is extremely important in order to maintain a consistent notion of time throughout the ...
CIE
2007
Springer
15 years 6 months ago
2007
Springer
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
109
click to vote
WSNA
2003
ACM
15 years 5 months ago
2003
ACM
Efficiently self organizing a network hierarchy with specific assignment of roles (or tasks) to sensors based on their physical wireless connectivity and sensing characteristics ...