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] |
|---|---|
| Autor Principal: | |
| 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 |
| Idioma: | inglés |
| Publicado: |
2007
|
| Series: | Control, computer engineeringand information science |
| Subjects: | |
| Acceso en liña: | http://www.lib.tpu.ru/fulltext/v/Bulletin_TPU/2007/v311eng/i5/18.pdf |
| Formato: | Electrónico Capítulo de libro |
| KOHA link: | https://koha.lib.tpu.ru/cgi-bin/koha/opac-detail.pl?biblionumber=183084 |
| Descrición Física: | 1 файл (668 Кб) |
|---|---|
| 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 |