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...

Full description

Bibliographic Details

Published in:	IEEE communications letters Vol. 22; no. 7; pp. 1330 - 1333
Main Authors:	Wei, Wei, Liu, Yang, Zhang, Ruqing
Format:	Journal Article
Language:	English
Published:	IEEE 01.07.2018
Subjects:	Acceleration Buildings Computational modeling cut vertex graph preprocessing Graph theory Indexes Maximum flow overlay graph simple path Time complexity
ISSN:	1089-7798, 1558-2558
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!