Publication: Heuristic Incremental Breadth-First Search
Loading...
Files
TIYAWATTANAROJ-KAWIN-THESIS.pdf (177.15 KB)
Date
2021-08-16
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Access Restrictions
Walk-in Access. This thesis can only be viewed on computer terminals at the <a href=http://mudd.princeton.edu>Mudd Manuscript Library</a>.
Abstract
We implemented an algorithm to find a maximum flow called Heuristic Incremental Breadth-First Search (IBFS), which is an extension of an existing algorithm IBFS. In this paper, we provide a new, more robust algorithm using heuristic function to improve per- formance of the algorithm. We also perform experimental analysis to compare the perfor- mance of our algorithm with existing algorithms.
Description
Type of resource
Princeton University Senior Theses