SPLMax: Exploiting the Simple Path Introduced Locality for Maximum Flow Acceleration

As a basic problem in graph theory, the maximum flow (max-flow) problem has important applications in networking and communication related areas. The simple path introduced locality is implicit in classic max-flow algorithms, i.e., only the vertices in simple paths between source and sink are involv...

Celý popis

Podrobná bibliografia

Vydané v:	IEEE communications letters Ročník 22; číslo 7; s. 1330 - 1333
Hlavní autori:	Wei, Wei, Liu, Yang, Zhang, Ruqing
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	IEEE 01.07.2018
Predmet:	Acceleration Buildings Computational modeling cut vertex graph preprocessing Graph theory Indexes Maximum flow overlay graph simple path Time complexity
ISSN:	1089-7798, 1558-2558
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!