edge covering number
(graph theory) The number of edges in a minimum edge cover of a graph, often denoted as 𝜌=𝜌(G).
Acronym of pan-assay interference compound.
(humorous, euphemistic) Lacking in intelligence; dimwitted.
plural of lint roller
グラフの辺被覆数（ρ(G)と表される）は、すべての頂点を覆うために必要な最小辺被覆の辺の数に等しく、マッチングや被覆に関する問題で重要な役割を果たす。
Don't have an account? Sign up
Do you have an account? Login
DiQt
Free
★★★★★★★★★★
