| Description |
x, 586 p. 28.000 x 022.000 cm. |
| Series |
Proceedings in Applied Mathematics Ser. No. 81
|
|
ACM Digital Library
|
| Access |
License restrictions may limit access. |
| Summary |
Annotation From over 200 submitted, the 65 papers were selected for their originality, quality, and relevance to the study of algorithms. Many report on continuing research that will probably be described more fully in scientific journals some time in the future. Among the topics are an efficient algorithm for the vertex-disjoint paths problem in random graphs, tiling a figure using a height in a tree, polynomial-time solutions to image segmentation, and a capacity scaling algorithm for convex cost submodular flows. No subject index. Annotation copyright by Book News, Inc., Portland, OR |
| Added Author |
Tardos,E. Editor Editor.
|
|
ACM Digital Library
|
| ISBN |
9780898713664 |
|
0898713668 (Trade Paper) USD 84.00 Retail Price (Publisher) Active Record |
| UPC # |
9780898713664 |
| OCLC # |
sseb_ssj0000813763 |
|
