Discrete Algorithms and Complexity
eBook - PDF

Discrete Algorithms and Complexity

Proceedings of the Japan-US Joint Seminar, June 4 – 6, 1986, Kyoto, Japan

  1. 496 pages
  2. English
  3. PDF
  4. Available on iOS & Android
eBook - PDF

Discrete Algorithms and Complexity

Proceedings of the Japan-US Joint Seminar, June 4 – 6, 1986, Kyoto, Japan

About this book

Perspectives in Computing, Volume 15: Discrete Algorithms and Complexity provides an understanding of discrete algorithms and complexity. This book covers a variety of topics, including discrete logarithm algorithms, parallel bubbling, electronic prototyping, number theoretic complexity, and linear programming. Organized into 27 chapters, this volume begins with an overview of the basic solutions of the primal and dual that can be characterized in graph-theoretic terms. This text then explores the principal partition of vertex-weighted graphs, which is utilized to solve certain assignment problems or flow problems that are formulated using such graphs. Other chapters consider a polynomial-time algorithm for finding the geodesic center of a simple polygon. This book discusses as well the three efficient algorithms for the routing problems around a rectangle. The final chapter deals with a snoopy cache multiprocessor system wherein each processor has a cache in which it stores blocks of data. This book is a valuable resource for mathematicians and researchers.

Frequently asked questions

Yes, you can cancel anytime from the Subscription tab in your account settings on the Perlego website. Your subscription will stay active until the end of your current billing period. Learn how to cancel your subscription.
No, books cannot be downloaded as external files, such as PDFs, for use outside of Perlego. However, you can download books within the Perlego app for offline reading on mobile or tablet. Learn more here.
Perlego offers two plans: Essential and Complete
  • Essential is ideal for learners and professionals who enjoy exploring a wide range of subjects. Access the Essential Library with 800,000+ trusted titles and best-sellers across business, personal growth, and the humanities. Includes unlimited reading time and Standard Read Aloud voice.
  • Complete: Perfect for advanced learners and researchers needing full, unrestricted access. Unlock 1.4M+ books across hundreds of subjects, including academic and specialized titles. The Complete Plan also includes advanced features like Premium Read Aloud and Research Assistant.
Both plans are available with monthly, semester, or annual billing cycles.
We are an online textbook subscription service, where you can get access to an entire online library for less than the price of a single book per month. With over 1 million books across 1000+ topics, we’ve got you covered! Learn more here.
Look out for the read-aloud symbol on your next book to see if you can listen to it. The read-aloud tool reads text aloud for you, highlighting the text as it is being read. You can pause it, speed it up and slow it down. Learn more here.
Yes! You can use the Perlego app on both iOS or Android devices to read anytime, anywhere — even offline. Perfect for commutes or when you’re on the go.
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app.
Yes, you can access Discrete Algorithms and Complexity by David S. Johnson,Takao Nishizeki,Akihiro Nozaki in PDF and/or ePUB format, as well as other popular books in Mathematics & Mathematics General. We have over one million books available in our catalogue for you to explore.

Information

Publisher
Academic Press
Year
2014
Print ISBN
9780123868701
eBook ISBN
9781483274003
Topic
Mathematics
Subtopic
Mathematics General
Index
Mathematics

Table of contents

  1. Front Cover
  2. Discrete Algorithms and Complexity
  3. Copyright Page
  4. Table of Contents
  5. Contributors
  6. Foreword
  7. Chapter 1. An Upper Bound on the Expected Cost of an Optimal Assignment
  8. Chapter 2. The Principal Partition of Vertex-Weighted Graphs and Its Applications
  9. Chapter 3. Generalized Colorings
  10. Chapter 4. Voronoi Diagram for Points in a Simple Polygon
  11. Chapter 5. Computing the Geodesic Center of a Simple Polygon
  12. Chapter 6. On deleting vertices to make a graph of positive genus planar
  13. Chapter 7. Algorithms for Routing around a Rectangle
  14. Chapter 8. A Remark on the Complexity of the Knapsack Problem
  15. Chapter 9. Fast, Rigorous Factorisation and Diecrete Logarltha Algoritluas
  16. Chapter 10. Redundant Coding for Local Computability
  17. Chapter 11. SOME PROPERTIES OF THE PARALLEL BUBBLING ΑΝD PARALLEL SORTS ON A MESH—OONNEOTEOD ROOESSOR ARRAY
  18. Chapter 12. Game Solving Procedure H Is Unsurpassed
  19. Chapter 13. Algorithmic Problems in Modeling and Electronic Prototyping
  20. Chapter 14. Complementary Approaches to CNF Boolean Equations
  21. Chapter 15. Open Problems in Number Theoretic Complexity
  22. Chapter 16. Decision Problem of the Security for Cryptographic Protocols
  23. Chapter 17. A Digital Signature Scheme Secure Against Adaptive Chosen Message Attack
  24. Chapter 18. Are problems having a polynomial time upper bound actually thought to be feasible ?
  25. Chapter 19. On Probability that a Randomly Selected Set Has Some complexity-Theoretical Property
  26. Chapter 20. Ranking Rooted Trees, and a Graceful Application
  27. Chapter 21. Dynamic Search in Graphs
  28. Chapter 22. Dynamic Search in Graphs
  29. Chapter 23. A Leaf-Size Hierarchy of Two-Dimensional Alternating Turing Machines
  30. CHAPTER 24. SIMPLE PROGRAMS WITH A FIXED NUMBER OF VARIABLES SEEM STILL HARD TO ANALYZE
  31. Chapter 25. Theory of the Multiplicative Penalty Function Method for Linear Programming
  32. Chapter 26. Linear-time Computability of Combinatorial Problems on Generalized-Series-Parallel Graphs
  33. Chapter 27. COMPETITIVE SNOOPY CACHING
  34. PERSPECTIVES IN COMPUTING