↓ Skip to main content
What is this page? Embed badge

Algorithms and Computation

Overview of attention for book
Cover of 'Algorithms and Computation'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 52 Methods in parallel algorithmics and who may need to know them?
  3. Altmetric Badge
    Chapter 53 Rectilinear paths among rectilinear obstacles
  4. Altmetric Badge
    Chapter 54 Linear time algorithms for k-cutwidth problem
  5. Altmetric Badge
    Chapter 55 The k-edge-connectivity augmentation problem of weighted graphs
  6. Altmetric Badge
    Chapter 56 Principal lattice of partitions of submodular functions on graphs: Fast algorithms for principal partition and generic rigidity
  7. Altmetric Badge
    Chapter 57 The application of the searching over separators strategy to solve some NP-complete problems on planar graphs
  8. Altmetric Badge
    Chapter 58 Parallel and on-line graph coloring algorithms
  9. Altmetric Badge
    Chapter 59 Competitive analysis of the Round Robin algorithm
  10. Altmetric Badge
    Chapter 60 Competitive analysis of the on-line algorithms for multiple stacks systems
  11. Altmetric Badge
    Chapter 61 Self-adjusting augmented search trees
  12. Altmetric Badge
    Chapter 62 Algorithms for a class of Min-Cut and Max-Cut problem
  13. Altmetric Badge
    Chapter 63 Algorithms for rectilinear optimal multicast tree problem
  14. Altmetric Badge
    Chapter 64 Approximating treewidth and pathwidth of some classes of perfect graphs
  15. Altmetric Badge
    Chapter 65 Graph spanners and connectivity
  16. Altmetric Badge
    Chapter 66 Randomized range-maxima in nearly-constant parallel time
  17. Altmetric Badge
    Chapter 67 Fault-tolerant broadcasting in binary jumping networks
  18. Altmetric Badge
    Chapter 68 Routing problems on the mesh of buses
  19. Altmetric Badge
    Chapter 69 Selection networks with 8 n log 2 n size and O (log n ) depth
  20. Altmetric Badge
    Chapter 70 Relativizations of the P=? NP and other problems: Some developments in structural complexity theory
  21. Altmetric Badge
    Chapter 71 Boolean circuit complexity
  22. Altmetric Badge
    Chapter 72 Searching a solid pseudo 3-sided orthoconvex grid
  23. Altmetric Badge
    Chapter 73 An efficient parallel algorithm for geometrically characterising drawings of a class of 3-D objects
  24. Altmetric Badge
    Chapter 74 Topologically consistent algorithms related to convex polyhedra
  25. Altmetric Badge
    Chapter 75 Characterizing and recognizing visibility graphs of Funnel-shaped polygons
  26. Altmetric Badge
    Chapter 76 On the complexity of composite numbers
  27. Altmetric Badge
    Chapter 77 On malign input distributions for algorithms
  28. Altmetric Badge
    Chapter 78 Lowness and the complexity of sparse and tally descriptions
  29. Altmetric Badge
    Chapter 79 Honest iteration schemes of randomizing algorithms
  30. Altmetric Badge
    Chapter 80 Approximating vertices of a convex polygon with grid points in the polygon
  31. Altmetric Badge
    Chapter 81 Algorithms for determining the geometrical congruity in two and three dimensions
  32. Altmetric Badge
    Chapter 82 On the relationships among constrained geometric structures
  33. Altmetric Badge
    Chapter 83 Generating small convergent systems can be extremely hard
  34. Altmetric Badge
    Chapter 84 Chew's theorem revisited — uniquely normalizing property of nonlinear term rewriting systems
  35. Altmetric Badge
    Chapter 85 Higher order communicating processes with Value-Passing, Assignment and return of results
  36. Altmetric Badge
    Chapter 86 Searching informed game trees
  37. Altmetric Badge
    Chapter 87 How to generate realistic sample problems for network optimization
  38. Altmetric Badge
    Chapter 88 Generalized assignment problems
  39. Altmetric Badge
    Chapter 89 Recognizing an envelope of lines in linear time
  40. Altmetric Badge
    Chapter 90 Approximation of polygonal curves with minimum number of line segments
  41. Altmetric Badge
    Chapter 91 Wiring knock-knee layouts: A global approach
  42. Altmetric Badge
    Chapter 92 Algorithms for finding non-crossing paths with minimum total length in plane graphs
  43. Altmetric Badge
    Chapter 93 On symmetry of information and polynomial time invertibility
  44. Altmetric Badge
    Chapter 94 On probabilistic ACC circuits with an exact-threshold output gate
  45. Altmetric Badge
    Chapter 95 Computational and statistical indistinguishabilities
  46. Altmetric Badge
    Chapter 96 On symmetric differences of NP-hard sets with weakly-P-selective sets
  47. Altmetric Badge
    Chapter 97 Restricted track assignment with applications
  48. Altmetric Badge
    Chapter 98 A simple test for the consecutive ones property
  49. Altmetric Badge
    Chapter 99 The longest common subsequence problem for small alphabet size between many strings
  50. Altmetric Badge
    Chapter 100 The implicit dictionary problem revisited
  51. Altmetric Badge
    Chapter 101 Sorting in-place with a worst case complexity of n log n −1.3 n+O (log n ) comparisons and ε n log n+O (1) transports
  52. Altmetric Badge
    Chapter 102 Sorting and/by merging finger trees
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

wikipedia
4 Wikipedia pages

Readers on

mendeley
1 Mendeley
Summary Wikipedia
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.
Title
Algorithms and Computation
Published by
Springer Berlin Heidelberg, January 2006
DOI 10.1007/3-540-56279-6
ISBNs
978-3-54-056279-5, 978-3-54-047501-9
Editors

Ibaraki, Toshihide, Inagaki, Yasuyoshi, Iwama, Kazuo, Nishizeki, Takao, Yamashita, Masafumi

View on publisher site
Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 1 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 1 100%
Readers by discipline Count As %
Business, Management and Accounting 1 100%

This page is provided by Altmetric.