↓ Skip to main content

Optimal Algorithms

Overview of attention for book
Cover of 'Optimal Algorithms'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Randomization in parallel algorithms and its impact on computational geometry
  3. Altmetric Badge
    Chapter 2 There are planar graphs almost as good as the complete graphs and as short as minimum spanning trees
  4. Altmetric Badge
    Chapter 3 Computing digitized voronoi diagrams on a systolic screen and applications to clustering
  5. Altmetric Badge
    Chapter 4 PRAM algorithms for identifying polygon similarity
  6. Altmetric Badge
    Chapter 5 A framework for parallel graph algorithm design
  7. Altmetric Badge
    Chapter 6 Fast soliton automata
  8. Altmetric Badge
    Chapter 7 An upper bound on the order of locally testable deterministic finite automata
  9. Altmetric Badge
    Chapter 8 A fast algorithm to decide on simple grammars equivalence
  10. Altmetric Badge
    Chapter 9 Complexity of the parallel Givens factorization on shared memory architectures
  11. Altmetric Badge
    Chapter 10 Optimal bounds on the dictionary problem
  12. Altmetric Badge
    Chapter 11 Optimal constant space move-to-fear list organization
  13. Altmetric Badge
    Chapter 12 Improved bounds on the size of separators of toroidal graphs
  14. Altmetric Badge
    Chapter 13 On some properties of (a,b)-trees
  15. Altmetric Badge
    Chapter 14 Disassembling two-dimensional composite parts via translations
  16. Altmetric Badge
    Chapter 15 Which triangulations approximate the complete graph?
  17. Altmetric Badge
    Chapter 16 The approximability of problems complete for P
  18. Altmetric Badge
    Chapter 17 A structural overview of NP optimization problems
  19. Altmetric Badge
    Chapter 18 Sorting within distance bound on a mesh-connected processor array
  20. Altmetric Badge
    Chapter 19 Local insertion sort revisited
  21. Altmetric Badge
    Chapter 20 Packet routing on grids of processors
  22. Altmetric Badge
    Chapter 21 Optimal parallel computations for halin graphs
  23. Altmetric Badge
    Chapter 22 Optimal parallel algorithms for b-matchings in trees
Attention for Chapter 15: Which triangulations approximate the complete graph?
Altmetric Badge

Readers on

mendeley
6 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Chapter title
Which triangulations approximate the complete graph?
Chapter number 15
Book title
Optimal Algorithms
Published by
Springer, Berlin, Heidelberg, January 1989
DOI 10.1007/3-540-51859-2_15
Book ISBNs
978-3-54-051859-4, 978-3-54-046831-8
Authors

Gautam Das, Deborah Joseph

Mendeley readers

The data shown below were compiled from readership statistics for 6 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 6 100%

Demographic breakdown

Readers by professional status Count As %
Professor > Associate Professor 1 17%
Lecturer 1 17%
Student > Master 1 17%
Unknown 3 50%
Readers by discipline Count As %
Mathematics 1 17%
Computer Science 1 17%
Agricultural and Biological Sciences 1 17%
Unknown 3 50%