8 search results - page 2 / 2 » Strong edge-magic graphs of maximum size |
CPM
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. In the context of non-coding RNA (ncRNA) multiple structural alignment, Davydov and Batzoglou introduced in [7] the problem of finding the largest nested linear graph tha...
PODC
2005
ACM
13 years 11 months ago
2005
ACM
The problem of verifying a Minimum Spanning Tree (MST) was introduced by Tarjan in a sequential setting. Given a graph and a tree that spans it, the algorithm is required to check...
INFOCOM
2011
IEEE
12 years 9 months ago
2011
IEEE
—We address pairwise and (for the first time) triple key establishment problems in wireless sensor networks (WSN). We use combinatorial designs to establish pairwise keys betwee...