Algorithm 2: Decontamination

1
Algorithm 2Decontamination

• Problem Formulation

Nathan Britton nbritton_at_hawaii.edu
2
Contents

• Input
• Tree
• Tertiary functions
• Output
• Requirement
• Constraints

3
Input

• An non-rooted tree

V intersection
E tunnel
4
Input

• Thresholds
• s(e,v)

v
e
5
Input

• Adjacency
• a(S(ep,v), S(ek,v)) adjacent

ek
S(ek,v)
ep
S(ep,v)
v
6
Input

• Adjacency Rationalization

does not equal
7
Input

• Machines

m(s1) machine
s1
s2
m(s2) no machine
8
Input

• Intersection degree

t(v) 4
v
9
Input

• Clean/Contaminated state

c(v1) contaminated
v1
c(e) contaminated
e
c(v2) clean
v2
10
Output

• Sequence of manipulations of machines

11
Output

• Number of machines used
• use as few machines as possible

12
Machine counting