External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Tags

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Exponential Space Complexity for Symbolic Maximum Flow Algorithms in 0-1 Networks

Beate Bollig. Exponential Space Complexity for Symbolic Maximum Flow Algorithms in 0-1 Networks. In Petr Hlinený, Antonín Kucera, editors, Mathematical Foundations of Computer Science 2010, 35th International Symposium, MFCS 2010, Brno, Czech Republic, August 23-27, 2010. Proceedings. Volume 6281 of Lecture Notes in Computer Science, pages 186-197, Springer, 2010. [doi]

Abstract

Abstract is missing.

runs on