214 search results - page 25 / 43 » A linear time algorithm for L(2,1)-labeling of trees |
66
Voted
CASES
2010
ACM
14 years 8 months ago
2010
ACM
Common generated instruction selections are based on tree pattern matching, but modern and custom architectures feature instructions, which cannot be covered by trees. To overcome...
103
Voted
SP
2010
IEEE
14 years 8 months ago
2010
IEEE
Abstract--We consider resource-constrained broadcast authentication for n receivers in a static, known network topology. There are only two known broadcast authentication protocols...
105
click to vote
ICCAD
1999
IEEE
15 years 2 months ago
1999
IEEE
The minimum rectilinear Steiner tree (RST) problem is one of the fundamental problems in the field of electronic design automation. The problem is NP-hard, and much work has been ...
124
Voted
CPM
2005
Springer
15 years 3 months ago
2005
Springer
Permutations on strings representing gene clusters on genomes have been studied earlier in [18, 14, 3, 12, 17] and the idea of a maximal permutation pattern was introduced in [12]....
110
Voted
PLANX
2007
14 years 11 months ago
2007
We present an algorithm to solve XPath decision problems under regular tree type constraints and show its use to statically typecheck XPath queries. To this end, we prove the deci...