↓ Skip to main content

Computer Science – Theory and Applications

Overview of attention for book
Cover of 'Computer Science – Theory and Applications'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Complexity of Generation
  3. Altmetric Badge
    Chapter 2 Lower Bounds for Unrestricted Boolean Circuits: Open Problems
  4. Altmetric Badge
    Chapter 3 Online Labeling: Algorithms, Lower Bounds and Open Questions
  5. Altmetric Badge
    Chapter 4 Maintaining Chordal Graphs Dynamically: Improved Upper and Lower Bounds
  6. Altmetric Badge
    Chapter 5 Distributed Symmetry-Breaking Algorithms for Congested Cliques
  7. Altmetric Badge
    Chapter 6 The Clever Shopper Problem
  8. Altmetric Badge
    Chapter 7 A Tight Lower Bound for Steiner Orientation
  9. Altmetric Badge
    Chapter 8 Can We Create Large k -Cores by Adding Few Edges?
  10. Altmetric Badge
    Chapter 9 Periodicity in Data Streams with Wildcards
  11. Altmetric Badge
    Chapter 10 Maximum Colorful Cycles in Vertex-Colored Graphs
  12. Altmetric Badge
    Chapter 11 Grammar-Based Compression of Unranked Trees
  13. Altmetric Badge
    Chapter 12 Complement for Two-Way Alternating Automata
  14. Altmetric Badge
    Chapter 13 Closure Under Reversal of Languages over Infinite Alphabets
  15. Altmetric Badge
    Chapter 14 Structural Parameterizations of Dominating Set Variants
  16. Altmetric Badge
    Chapter 15 Complexity and Inapproximability Results for Parallel Task Scheduling and Strip Packing
  17. Altmetric Badge
    Chapter 16 Operations on Boolean and Alternating Finite Automata
  18. Altmetric Badge
    Chapter 17 Conflict Free Version of Covering Problems on Graphs: Classical and Parameterized
  19. Altmetric Badge
    Chapter 18 Quadratically Tight Relations for Randomized Query Complexity
  20. Altmetric Badge
    Chapter 19 On Vertex Coloring Without Monochromatic Triangles
  21. Altmetric Badge
    Chapter 20 Recognizing Read-Once Functions from Depth-Three Formulas
  22. Altmetric Badge
    Chapter 21 M ax -C ut A bove S panning T ree is Fixed-Parameter Tractable
  23. Altmetric Badge
    Chapter 22 Slopes of 3-Dimensional Subshifts of Finite Type
  24. Altmetric Badge
    Chapter 23 Facility Location on Planar Graphs with Unreliable Links
  25. Altmetric Badge
    Chapter 24 On the Decision Trees with Symmetries
  26. Altmetric Badge
    Chapter 25 On Emptiness and Membership Problems for Set Automata
  27. Altmetric Badge
    Chapter 26 On Strong NP-Completeness of Rational Problems
  28. Altmetric Badge
    Chapter 27 A New Algorithm for Finding Closest Pair of Vectors (Extended Abstract)
Attention for Chapter 4: Maintaining Chordal Graphs Dynamically: Improved Upper and Lower Bounds
Altmetric Badge

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
Maintaining Chordal Graphs Dynamically: Improved Upper and Lower Bounds
Chapter number 4
Book title
Computer Science – Theory and Applications
Published by
Springer, Cham, June 2018
DOI 10.1007/978-3-319-90530-3_4
Book ISBNs
978-3-31-990529-7, 978-3-31-990530-3
Authors

Niranka Banerjee, Venkatesh Raman, Srinivasa Rao Satti, Banerjee, Niranka, Raman, Venkatesh, Satti, Srinivasa Rao

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 %
Student > Ph. D. Student 1 25%
Professor > Associate Professor 1 25%
Student > Master 1 25%
Unknown 1 25%
Readers by discipline Count As %
Computer Science 2 50%
Unknown 2 50%