Matrix algorithm of solving graph cutting problem; Bulletin of the Tomsk Polytechnic University; Vol. 311, № 5
| Parent link: | Bulletin of the Tomsk Polytechnic University/ Tomsk Polytechnic University (TPU).— , 2006-2007 Vol. 311, № 5.— 2007.— [P. 84-88] |
|---|---|
| Main Author: | |
| Summary: | Заглавие с титульного листа Электронная версия печатной публикации Matrix algorithm of solving graph cutting problem has been suggested. The main algorithm points based on matrix graph presentation were considered. Formalization of the main algorithm procedures - defining estimations for selecting relocatable matrix elements and matrix conversion by reciprocal transfer of columns and lines was given. Algorithm operation was considered by the example of data transmission graph between the stations of local computer system network |
| Language: | English |
| Published: |
2007
|
| Series: | Control, computer engineeringand information science |
| Subjects: | |
| Online Access: | http://www.lib.tpu.ru/fulltext/v/Bulletin_TPU/2007/v311eng/i5/18.pdf |
| Format: | Electronic Book Chapter |
| KOHA link: | https://koha.lib.tpu.ru/cgi-bin/koha/opac-detail.pl?biblionumber=183084 |
MARC
| LEADER | 00000nla2a2200000 4500 | ||
|---|---|---|---|
| 001 | 183084 | ||
| 005 | 20231031171449.0 | ||
| 035 | |a (RuTPU)RU\TPU\book\198462 | ||
| 035 | |a RU\TPU\book\198460 | ||
| 090 | |a 183084 | ||
| 100 | |a 20100630d2007 k y0rusy50 ca | ||
| 101 | 1 | |a eng |c rus | |
| 102 | |a RU | ||
| 135 | |a drnn ---uucaa | ||
| 200 | 1 | |a Matrix algorithm of solving graph cutting problem |b Electronic resource |f V. K. Pogrebnoy | |
| 203 | |a Text |c electronic | ||
| 215 | |a 1 файл (668 Кб) | ||
| 225 | 1 | |a Control, computer engineeringand information science | |
| 230 | |a Электронные текстовые данные (1 файл : 668 Кб) | ||
| 300 | |a Заглавие с титульного листа | ||
| 300 | |a Электронная версия печатной публикации | ||
| 320 | |a [Bibliography: p. 88 (4 titles)] | ||
| 330 | |a Matrix algorithm of solving graph cutting problem has been suggested. The main algorithm points based on matrix graph presentation were considered. Formalization of the main algorithm procedures - defining estimations for selecting relocatable matrix elements and matrix conversion by reciprocal transfer of columns and lines was given. Algorithm operation was considered by the example of data transmission graph between the stations of local computer system network | ||
| 337 | |a Adobe Reader | ||
| 461 | 1 | |0 (RuTPU)RU\TPU\book\169973 |t Bulletin of the Tomsk Polytechnic University |f Tomsk Polytechnic University (TPU) |d 2006-2007 | |
| 463 | 1 | |0 (RuTPU)RU\TPU\book\198425 |t Vol. 311, № 5 |v [P. 84-88] |d 2007 |p 132 p. | |
| 610 | 1 | |a matrix algorithm | |
| 610 | 1 | |a cutting | |
| 610 | 1 | |a graphs | |
| 610 | 1 | |a formalization | |
| 610 | 1 | |a elements | |
| 610 | 1 | |a columns | |
| 610 | 1 | |a lines | |
| 610 | 1 | |a data transmission | |
| 610 | 1 | |a local networks | |
| 610 | 1 | |a computer systems | |
| 610 | 1 | |a труды учёных ТПУ | |
| 610 | 1 | |a электронный ресурс | |
| 675 | |a 681.3.06 |v 3 | ||
| 700 | 1 | |a Pogrebnoy |b V. K. |c specialist in the field of Informatics and computer engineering |c Professor of Tomsk Polytechnic University, doctor of technical sciences |f 1942- |g Vladimir Kirillovich |2 stltpush |3 (RuTPU)RU\TPU\pers\33680 | |
| 801 | 1 | |a RU |b 63413507 |c 20090623 |g PSBO | |
| 801 | 2 | |a RU |b 63413507 |c 20151222 |g PSBO | |
| 856 | 4 | |u http://www.lib.tpu.ru/fulltext/v/Bulletin_TPU/2007/v311eng/i5/18.pdf | |
| 942 | |c CF | ||