↓ Skip to main content

Computing strongly connected components in the streaming model

Overview of attention for book
Cover of 'Computing strongly connected components in the streaming model'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Distributed Decision Problems: The Locality Angle
  3. Altmetric Badge
    Chapter 2 Managing Power Heterogeneity
  4. Altmetric Badge
    Chapter 3 The Mathematics of Mobility
  5. Altmetric Badge
    Chapter 4 Speed Scaling to Manage Temperature
  6. Altmetric Badge
    Chapter 5 Alternative Route Graphs in Road Networks
  7. Altmetric Badge
    Chapter 6 Robust Line Planning in Case of Multiple Pools and Disruptions
  8. Altmetric Badge
    Chapter 7 Exact Algorithms for Intervalizing Colored Graphs
  9. Altmetric Badge
    Chapter 8 L (2,1)-Labeling of Unigraphs
  10. Altmetric Badge
    Chapter 9 Energy-Efficient Due Date Scheduling
  11. Altmetric Badge
    Chapter 10 Go with the Flow: The Direction-Based Fréchet Distance of Polygonal Curves
  12. Altmetric Badge
    Chapter 11 A Comparison of Three Algorithms for Approximating the Distance Distribution in Real-World Graphs
  13. Altmetric Badge
    Chapter 12 Exploiting Bounded Signal Flow for Graph Orientation Based on Cause–Effect Pairs
  14. Altmetric Badge
    Chapter 13 On Greedy and Submodular Matrices
  15. Altmetric Badge
    Chapter 14 MIP Formulations for Flowshop Scheduling with Limited Buffers
  16. Altmetric Badge
    Chapter 15 A Scenario-Based Approach for Robust Linear Optimization
  17. Altmetric Badge
    Chapter 16 Conflict Propagation and Component Recursion for Canonical Labeling
  18. Altmetric Badge
    Chapter 17 3-hitting set on Bounded Degree Hypergraphs: Upper and Lower Bounds on the Kernel Size
  19. Altmetric Badge
    Chapter 18 Improved Taxation Rate for Bin Packing Games
  20. Altmetric Badge
    Chapter 19 Multi-channel Assignment for Communication in Radio Networks
  21. Altmetric Badge
    Chapter 20 Computing Strongly Connected Components in the Streaming Model
  22. Altmetric Badge
    Chapter 21 Improved Approximation Algorithms for the Max-Edge Coloring Problem
  23. Altmetric Badge
    Chapter 22 New Bounds for Old Algorithms: On the Average-Case Behavior of Classic Single-Source Shortest-Paths Approaches
  24. Altmetric Badge
    Chapter 23 An Approximative Criterion for the Potential of Energetic Reasoning
  25. Altmetric Badge
    Chapter 24 Speed Scaling for Energy and Performance with Instantaneous Parallelism
  26. Altmetric Badge
    Chapter 25 Algorithms for Scheduling with Power Control in Wireless Networks
Attention for Chapter 1: Distributed Decision Problems: The Locality Angle
Altmetric Badge

Readers on

mendeley
2 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
Distributed Decision Problems: The Locality Angle
Chapter number 1
Book title
Theory and Practice of Algorithms in (Computer) Systems
Published in
ADS, January 2011
DOI 10.1007/978-3-642-19754-3_1
Book ISBNs
978-3-64-219753-6, 978-3-64-219754-3
Authors

Shay Kutten, Kutten, Shay

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 2 100%

Demographic breakdown

Readers by professional status Count As %
Professor 1 50%
Unknown 1 50%
Readers by discipline Count As %
Computer Science 1 50%
Unknown 1 50%