Zone-interval reprezentation: различия между версиями
Перейти к навигации
Перейти к поиску
KVN (обсуждение | вклад) Нет описания правки |
KVN (обсуждение | вклад) Нет описания правки |
||
| Строка 4: | Строка 4: | ||
<math>G_0, G_1, \ldots, G_r</math> is called a '''zone-interval representation''' of | <math>G_0, G_1, \ldots, G_r</math> is called a '''zone-interval representation''' of | ||
the cf-graph <math>G</math>, if <math>G_0=G</math>, <math>G_r</math> contains no zones and for all <math>i</math>, <math>0<i\leq r</math>, the graph <math>G_i</math> is | the cf-graph <math>G</math>, if <math>G_0=G</math>, <math>G_r</math> contains no zones and for all <math>i</math>, <math>0<i\leq r</math>, the graph <math>G_i</math> is | ||
obtained from <math>G_{i-1}</math> by reduction of mutually disjoint intervals, being zones, into nodes. | obtained from <math>G_{i-1}</math> by reduction of mutually disjoint [[interval|intervals]], being [[zone|zones]], into nodes. | ||
==Литература== | ==Литература== | ||
Версия от 10:14, 22 октября 2019
Zone-interval reprezentation --- зонно-интервальное представление.
A sequence of different cf-graphs [math]\displaystyle{ G_0, G_1, \ldots, G_r }[/math] is called a zone-interval representation of the cf-graph [math]\displaystyle{ G }[/math], if [math]\displaystyle{ G_0=G }[/math], [math]\displaystyle{ G_r }[/math] contains no zones and for all [math]\displaystyle{ i }[/math], [math]\displaystyle{ 0\lt i\leq r }[/math], the graph [math]\displaystyle{ G_i }[/math] is obtained from [math]\displaystyle{ G_{i-1} }[/math] by reduction of mutually disjoint intervals, being zones, into nodes.
Литература
- Касьянов В.Н. Оптимизирующие преобразования программ. — М.: Наука, 1988.