Manuscript En01-A@1 · En01-A.tex · definition · 558b972b

Definition: Accessibility hypergraph

Implementability constraints and accessibility hypergraphs › The perfect-copy hypergraph · lines 2710–2718

En01-A@1#def:hypergraph

For each supported $J$ -split pair $π = {r, r^{'}}$ , define

E_{π} = j \in D (r, r^{'}) ⋃ K_{j} .

The hypergraph has vertex set $Q$ and these labelled hyperedges. Visibility is evaluated at an interface $S$ ; it is not a fixed interface-independent edge weight.

Displayed formulas in this passage

unlabeled · line 2712
$E_{π} = j \in D (r, r^{'}) ⋃ K_{j} .$

Nearby in this section

proposition: Proposition: Covering and a conditional tight budget
section: The perfect-copy hypergraph
proposition: Proposition: Copy-certified screening is a hitting-set condition
section: The perfect-copy hypergraph