↓ Skip to main content

Combinatorial Optimization and Applications

Overview of attention for book
Cover of 'Combinatorial Optimization and Applications'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Termination of Multipartite Graph Series Arising from Complex Network Modelling
  3. Altmetric Badge
    Chapter 2 Simple Cuts Are Fast and Good: Optimum Right-Angled Cuts in Solid Grids
  4. Altmetric Badge
    Chapter 3 Evacuation of Rectilinear Polygons
  5. Altmetric Badge
    Chapter 4 A Fast Algorithm for Powerful Alliances in Trees
  6. Altmetric Badge
    Chapter 5 NP-Completeness of Spreading Colored Points
  7. Altmetric Badge
    Chapter 6 Construction of Mixed Covering Arrays of Variable Strength Using a Tabu Search Approach
  8. Altmetric Badge
    Chapter 7 Feasibility-Based Bounds Tightening via Fixed Points
  9. Altmetric Badge
    Chapter 8 A Characterisation of Stable Sets in Games with Transitive Preference
  10. Altmetric Badge
    Chapter 9 Linear Coherent Bi-cluster Discovery via Beam Detection and Sample Set Clustering
  11. Altmetric Badge
    Chapter 10 An Iterative Algorithm of Computing the Transitive Closure of a Union of Parameterized Affine Integer Tuple Relations
  12. Altmetric Badge
    Chapter 11 Bases of Primitive Nonpowerful Sign Patterns
  13. Altmetric Badge
    Chapter 12 Extended Dynamic Subgraph Statistics Using h -Index Parameterized Data Structures
  14. Altmetric Badge
    Chapter 13 Discrete Optimization with Polynomially Detectable Boundaries and Restricted Level Sets
  15. Altmetric Badge
    Chapter 14 Finding Strong Bridges and Strong Articulation Points in Linear Time
  16. Altmetric Badge
    Chapter 15 Robust Optimization of Graph Partitioning and Critical Node Detection in Analyzing Networks
  17. Altmetric Badge
    Chapter 16 An Efficient Algorithm for Chinese Postman Walk on Bi-directed de Bruijn Graphs
  18. Altmetric Badge
    Chapter 17 On the Hardness and Inapproximability of Optimization Problems on Power Law Graphs
  19. Altmetric Badge
    Chapter 18 Cyclic Vertex Connectivity of Star Graphs
  20. Altmetric Badge
    Chapter 19 The Number of Shortest Paths in the ( n , k )-Star Graphs
  21. Altmetric Badge
    Chapter 20 Complexity of Determining the Most Vital Elements for the 1-median and 1-center Location Problems
  22. Altmetric Badge
    Chapter 21 PTAS for Minimum Connected Dominating Set with Routing Cost Constraint in Wireless Sensor Networks
  23. Altmetric Badge
    Chapter 22 A Primal-Dual Approximation Algorithm for the Asymmetric Prize-Collecting TSP
  24. Altmetric Badge
    Chapter 23 Computing Toolpaths for 5-Axis NC Machines
  25. Altmetric Badge
    Chapter 24 A Trichotomy Theorem for the Approximate Counting of Complex-Weighted Bounded-Degree Boolean CSPs
  26. Altmetric Badge
    Chapter 25 A Randomized Algorithm for Weighted Approximation of Points by a Step Function
  27. Altmetric Badge
    Chapter 26 Approximating Multilinear Monomial Coefficients and Maximum Multilinear Monomials in Multivariate Polynomials
  28. Altmetric Badge
    Chapter 27 The Union of Colorful Simplices Spanned by a Colored Point Set
  29. Altmetric Badge
    Chapter 28 Compact Visibility Representation of 4-Connected Plane Graphs
  30. Altmetric Badge
    Chapter 29 Some Variations on Constrained Minimum Enclosing Circle Problem
  31. Altmetric Badge
    Chapter 30 Searching for an Axis-Parallel Shoreline
  32. Altmetric Badge
    Chapter 31 Bounded Length, 2-Edge Augmentation of Geometric Planar Graphs
  33. Altmetric Badge
    Chapter 32 Scheduling Packets with Values and Deadlines in Size-Bounded Buffers
  34. Altmetric Badge
    Chapter 33 Transporting Jobs through a Processing Center with Two Parallel Machines
Attention for Chapter 14: Finding Strong Bridges and Strong Articulation Points in Linear Time
Altmetric Badge

Citations

dimensions_citation
2 Dimensions

Readers on

mendeley
4 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
Finding Strong Bridges and Strong Articulation Points in Linear Time
Chapter number 14
Book title
Combinatorial Optimization and Applications
Published in
ADS, December 2010
DOI 10.1007/978-3-642-17458-2_14
Book ISBNs
978-3-64-217457-5, 978-3-64-217458-2
Authors

Giuseppe F. Italiano, Luigi Laura, Federico Santaroni, Italiano, Giuseppe F., Laura, Luigi, Santaroni, Federico

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 4 100%

Demographic breakdown

Readers by professional status Count As %
Professor > Associate Professor 2 50%
Researcher 1 25%
Lecturer 1 25%
Readers by discipline Count As %
Computer Science 2 50%
Mathematics 1 25%
Agricultural and Biological Sciences 1 25%