↓ Skip to main content

Graph-Theoretic Concepts in Computer Science

Overview of attention for book
Cover of 'Graph-Theoretic Concepts in Computer Science'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Treewidth: Characterizations, Applications, and Computations
  3. Altmetric Badge
    Chapter 2 Locally Injective Graph Homomorphism: Lists Guarantee Dichotomy
  4. Altmetric Badge
    Chapter 3 Generalised Dualities and Finite Maximal Antichains
  5. Altmetric Badge
    Chapter 4 Chordal Deletion Is Fixed-Parameter Tractable
  6. Altmetric Badge
    Chapter 5 A Fixed-Parameter Algorithm for the Minimum Weight Triangulation Problem Based on Small Graph Separators
  7. Altmetric Badge
    Chapter 6 Divide-and-Color
  8. Altmetric Badge
    Chapter 7 Listing Chordal Graphs and Interval Graphs
  9. Altmetric Badge
    Chapter 8 A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs
  10. Altmetric Badge
    Chapter 9 Improved Edge-Coloring with Three Colors
  11. Altmetric Badge
    Chapter 10 Vertex Coloring of Comparability+ k e and – k e Graphs
  12. Altmetric Badge
    Chapter 11 Convex Drawings of Graphs with Non-convex Boundary
  13. Altmetric Badge
    Chapter 12 How to Sell a Graph: Guidelines for Graph Retailers
  14. Altmetric Badge
    Chapter 13 Strip Graphs: Recognition and Scheduling
  15. Altmetric Badge
    Chapter 14 Approximating the Traffic Grooming Problem in Tree and Star Networks
  16. Altmetric Badge
    Chapter 15 Bounded Arboricity to Determine the Local Structure of Sparse Graphs
  17. Altmetric Badge
    Chapter 16 An Implicit Representation of Chordal Comparabilty Graphs in Linear-Time
  18. Altmetric Badge
    Chapter 17 Partitioned Probe Comparability Graphs
  19. Altmetric Badge
    Chapter 18 Computing Graph Polynomials on Graphs of Bounded Clique-Width
  20. Altmetric Badge
    Chapter 19 Generation of Graphs with Bounded Branchwidth
  21. Altmetric Badge
    Chapter 20 Minimal Proper Interval Completions
  22. Altmetric Badge
    Chapter 21 Monotony Properties of Connected Visible Graph Searching
  23. Altmetric Badge
    Chapter 22 Finding Intersection Models of Weakly Chordal Graphs
  24. Altmetric Badge
    Chapter 23 A Fully Dynamic Algorithm for the Recognition of P 4 -Sparse Graphs
  25. Altmetric Badge
    Chapter 24 Clique Graph Recognition Is NP-Complete
  26. Altmetric Badge
    Chapter 25 Homogeneity vs. Adjacency: Generalising Some Graph Decomposition Algorithms
  27. Altmetric Badge
    Chapter 26 Certifying Algorithms for Recognizing Proper Circular-Arc Graphs and Unit Circular-Arc Graphs
  28. Altmetric Badge
    Chapter 27 Graph Labelings Derived from Models in Distributed Computing
  29. Altmetric Badge
    Chapter 28 Flexible Matchings
  30. Altmetric Badge
    Chapter 29 Simultaneous Graph Embeddings with Fixed Edges
  31. Altmetric Badge
    Chapter 30 Approximation Algorithms for Restricted Cycle Covers Based on Cycle Decompositions
  32. Altmetric Badge
    Chapter 31 Circular-Perfect Concave-Round Graphs
Attention for Chapter 13: Strip Graphs: Recognition and Scheduling
Altmetric Badge

Citations

dimensions_citation
3 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
Strip Graphs: Recognition and Scheduling
Chapter number 13
Book title
Graph-Theoretic Concepts in Computer Science
Published by
Springer, Berlin, Heidelberg, June 2006
DOI 10.1007/11917496_13
Book ISBNs
978-3-54-048381-6, 978-3-54-048382-3
Authors

Magnús M. Halldórsson, Ragnar K. Karlsson, Halldórsson, Magnús M., Karlsson, Ragnar K.

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 1 25%
Student > Ph. D. Student 1 25%
Professor > Associate Professor 1 25%
Lecturer 1 25%
Readers by discipline Count As %
Agricultural and Biological Sciences 2 50%
Computer Science 1 25%
Mathematics 1 25%