Please use this identifier to cite or link to this item:
http://earchive.tpu.ru/handle/11683/2460| Title: | Matrix algorithm of solving graph cutting problem |
| Authors: | Pogrebnoy, V. K. |
| Keywords: | matrix algorithm; cutting; graphs; formalization; elements; columns; lines; data transmission; local networks; computer systems |
| Issue Date: | 2007 |
| Publisher: | Томский политехнический университет |
| Citation: | Pogrebnoy V. K. Matrix algorithm of solving graph cutting problem / V. K. Pogrebnoy // Bulletin of the Tomsk Polytechnic University. — 2007. — Vol. 311, № 5. — [P. 84-88]. |
| Abstract: | 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 |
| URI: | http://earchive.tpu.ru/handle/11683/2460 |
| Appears in Collections: | Известия Томского политехнического университета. Инжиниринг георесурсов |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| bulletin_tpu-2007-311eng-5-18.pdf | 674,19 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.