hal@BOULDER.COLORADO.EDU (Hal Gabow) (02/03/90)
CALL FOR PAPERS
ALGORITHMICA SPECIAL ISSUE
ON NETWORK FLOW ALGORITHMS
ALGORITHMICA is dedicating a special issue to network flow
algorithms, in recognition of traditional interest and
significant recent progress in this area. Authors should note
the benefits of publication in a special issue -- a collection
of high-quality related papers in one volume, plus a guarantee
of publication of accepted papers with minimal time delay.
The emphasis of the special issue is efficient flow algorithms.
This includes algorithms for traditional network flow and
generalizations to multicommodity flows, lossy flows, matching,
matroid flow problems; sensitivity analysis; network analysis
and synthesis; efficient solution of problems using network
flow. The model of computation may be sequential, parallel or
distributed; deterministic or probabilistic algorithms, etc. The
algorithms should be provably efficient.
All manuscripts will be promptly and carefully refereed.
High-quality manuscripts not accepted for the special issue
because of space limitations may be accepted for a regular issue
of Algorithmica, if the author desires.
Authors should send four copies of a manuscript to
Harold N. Gabow
Department of Computer Science
University of Colorado at Boulder
Campus Box 430
Boulder, Colorado 80309
by July 31, 1990. Manuscripts should be in a format consistent
with that described in any recent issue of ALGORITHMICA.