Seller's image, know what you are getting! Pre-packing weight is 1 lb. 0.0 oz . ORIGINAL, NOT A REPRINT OR PHOTOCOPY!! NO Dust Jacket. Has all standard Library markings, pocket, labels, stamps, light wear and soil to covers. CLEAN TEXT! See Picture! The Copyright date is 1988 for this Printing. This volume was purchased through DMRO from the Wright-Patterson Technical Library in the late 1990's. Thank you for your purchase from Sunset Books! Help Promote World Literacy, GIVE a Book as a GIFT!! In stock, Ships from Ohio. WE COMBINE SHIPPING ON MULTIPLE PURCHASES!!!! SEE PICTURES!!!!! ANY ODD/GREEN TONES ON THE SCANS ARE CAUSED BY MY SCANNER!! All of our Technical/Textbook/Ex-Library volumes were obtained legally through Public or Auction sales. Size: 8vo.

Codice articolo 015535

Contatta il venditore

Segnala questo articolo

Dati bibliografici

Titolo

SWAT '88: 1st Scandinavian Workshop on Algorithm Theory Halmstad, Sweden, July 5-8, 1988. Proceedings (Lecture Notes in Computer Science)

Editore

Springer-Verlag, OHG, Berlin, Germany

Data di pubblicazione

1988

Lingua

Inglese

ISBN 10

3540194878

ISBN 13

9783540194873

Rilegatura

Paperback

Edizione

1st.

Condizione

Very Good

Condizione della sovraccoperta

No Jacket

Tipo di libro

Ex-Library

Cataloghi dei venditori

Descrizione articolo

Riassunto

The papers in this volume were presented at the 1st Scandinavian Workshop on Algorithm Theory held July 5-8, 1988 in Halmstad, Sweden. The contributions present original research in areas related to algorithm theory, including data structures, computational geometry, and computational complexity. In addition to the selected papers the proceedings include invited papers from I. Munro, K. Mehlhorn, M. Overmars, and D. Wood.

Contenuti

An implicit binomial queue with constant insertion time.- Implicit selection.- An extrapolation on the interpolation search.- Time parameter and arbitrary deunions in the set union problem.- Two new algorithms for constructing min-max heaps.- Extremal cost tree data structures.- Intersecting line segments, ray shooting, and other applications of geometric partitioning techniques.- Problems of posting sentries: Variations on the art gallery theorem.- A lower bound and two approximative algorithms for the K-partitioning of rectilinear polygons.- On recognizing and characterizing visibility graphs of simple polygons.- Connectability problems.- Two hybrid methods for collision resolution in open addressing hashing.- On an alternative sum useful in the analysis of some data structures.- Bin-packing in 1.5 dimension.- Applications of a symbolic perturbation scheme.- A fast parallel algorithm for computing all maximal cliques in a graph and the related problems.- Parallel solution of sparse linear systems.- A note on determining the 3-dimensional convex hull of a set of points on a mesh of processors.- Probabilistic log-space reductions and problems probabilistically hard for p.- Searching with uncertainty extended abstract.- An optimal expected-time parallel algorithm for Voronoi diagrams.- Generating binary trees by transpositions.- Approximating the complete Euclidean graph.- Upper and lower bounds for the dictionary problem.- Linear algorithms for graph separation problems.- Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees.- NC algorithms for computing the number of perfect matchings in K 3,3-free graphs and related problems.- Independent covers in outerplanar graphs.- Tight lower bounds for Shellsort.

Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.

Descrizione libreria

Thank You for looking at our books! We invite you to browse our bookstore for the many rare and antique volumes we have listed. Our listed books range the entire spectrum, with Mathematics, Physics, Nuclear Physics, Chemistry, Biochemistry, Aviation, Natural resources, Medicine,Electricity, Electronics, Philosophy, History, Genealogy, childrens books, Textbooks, Journals, and many more. Many of our rare/out-of-print volumes came from the U.S. Air Force Technical Library and are very unique. We strive to provide books to individuals around the world at competitive prices. Customers should know that 10-20% of their total order to include shipping cost goes to ABEbooks in fees and charges, especially on lower price volumes.

Visita la pagina della libreria

Informazioni sull?azienda del venditore

SUNSET BOOKS 2
OH, U.S.A.

Condizioni di vendita e spedizione

Condizioni di vendita

We guarantee the condition of every book as it's described on the Abebooks web sites. If you're dissatisfied with your purchase (Incorrect Book/Not as Described/Damaged) or if the order hasn't arrived, you're eligible for a refund within 30 days of the estimated delivery date. If you've changed your mind about a book that you've ordered, please use the Ask bookseller a question link to contact us and we'll respond within 2 business days.

Condizioni di spedizione

Orders usually ship within 2 business days. Shipping costs are based on books weighing 2.2 LB, or 1 KG. If your book order is heavy or oversized, we may contact you to let you know extra shipping is required. We never charge for Handling, Packing or Service, even for Media Mail.