Solving maximum flow problems on real-world bipartite graphs

doi:10.1145/1963190.2025381

Solving maximum flow problems on real-world bipartite graphs

Full Text:

PDF

Buy this Article

Authors:	Cosmin Silvestru Negrucşeri	Google Inc.
	Mircea BOGDAN Pacsoşi	University of Bucharest
	Barbara Stanley	Google Inc.
	Clifford Stein	Columbia University
	Cristian George Strat	University of Bucharest

	2008 Article
Bibliometrics
· Downloads (6 Weeks): 9 · Downloads (12 Months): 75 · Downloads (cumulative): 154 · Citation Count: 1

Published in:

· Journal

Journal of Experimental Algorithmics (JEA) JEA Homepage archive

Volume 16, May 2011
Article No. 3.5
ACM New York, NY, USA
table of contents doi>10.1145/1963190.2025381

Tools and Resources

Buy this Article
Request Permissions
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref

Share:

|

Tags: algorithms analysis of algorithms and problem complexity bipartite graph design experimentation flow performance preflow push real-world

Feedback | Switch to single page view (no tabs)

**Javascript is not enabled and is required for the "tabbed view" or switch to the single page view**

Powered by

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage Privacy Policy Code of Ethics Contact Us

Useful downloads:

Adobe Acrobat

QuickTime

Windows Media Player

Real Player

The ACM Guide to Computing Literature

All Tags

Export Formats

Save to Binder