Csóka, Endre (2016) Maximum flow is approximable by deterministic constant-time algorithm in sparse networks. Journal of Graph Theory. pp. 1-8. ISSN 0364-9024
|
Text
a7e25a872a3921da4a5884a885f2a077d3fe.pdf Download (113kB) | Preview |
Abstract
We show a deterministic constant-time parallel algorithm for finding an almost maximum flow in multisource-multitarget networks with bounded degrees and bounded edge capacities. As a consequence, we show that the value of the maximum flow over the number of nodes is a testable parameter on these networks.
| Item Type: | Article |
|---|---|
| Additional Information: | accepted with revision |
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika |
| SWORD Depositor: | MTMT SWORD |
| Depositing User: | MTMT SWORD |
| Date Deposited: | 02 Jan 2017 14:53 |
| Last Modified: | 02 Jan 2017 14:53 |
| URI: | http://real.mtak.hu/id/eprint/44109 |
Actions (login required)
 |
Edit Item |
