↓ 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 33 Domino treewidth
  3. Altmetric Badge
    Chapter 34 A lower bound for treewidth and its consequences
  4. Altmetric Badge
    Chapter 35 Tree-width and path-width of comparability graphs of interval orders
  5. Altmetric Badge
    Chapter 36 A declarative approach to graph based modeling
  6. Altmetric Badge
    Chapter 37 Multilevel graph grammars
  7. Altmetric Badge
    Chapter 38 The algorithmic use of hypertree structure and maximum neighbourhood orderings
  8. Altmetric Badge
    Chapter 39 On domination elimination orderings and domination graphs
  9. Altmetric Badge
    Chapter 40 Complexity of graph covering problems
  10. Altmetric Badge
    Chapter 41 Dominoes
  11. Altmetric Badge
    Chapter 42 GLB-closures in directed acyclic graphs and their applications
  12. Altmetric Badge
    Chapter 43 Minimum vertex cover, distributed decision-making, and communication complexity
  13. Altmetric Badge
    Chapter 44 Cartesian products of graphs as spanning subgraphs of de Bruijn graphs
  14. Altmetric Badge
    Chapter 45 Specification of graph translators with triple graph grammars
  15. Altmetric Badge
    Chapter 46 Using programmed graph rewriting for the formal specification of a configuration management system
  16. Altmetric Badge
    Chapter 47 Exponential time analysis of confluent and boundary eNCE graph languages
  17. Altmetric Badge
    Chapter 48 Time-optimal tree computations on sparse meshes
  18. Altmetric Badge
    Chapter 49 Prefix graphs and their applications
  19. Altmetric Badge
    Chapter 50 The complexity of broadcasting in planar and decomposable graphs
  20. Altmetric Badge
    Chapter 51 The maximal f -dependent set problem for planar graphs is in NC
  21. Altmetric Badge
    Chapter 52 On-line convex planarity testing
  22. Altmetric Badge
    Chapter 53 Book embeddings and crossing numbers
  23. Altmetric Badge
    Chapter 54 Measuring the distance to series-parallelity by path expressions
  24. Altmetric Badge
    Chapter 55 Labelled trees and pairs of input-output permutations in priority queues
  25. Altmetric Badge
    Chapter 56 Rankings of graphs
  26. Altmetric Badge
    Chapter 57 Bypass strong V-structures and find an isomorphic labelled subgraph in linear time
  27. Altmetric Badge
    Chapter 58 Efficient algorithms for a mixed k-partition problem of graphs without specifying bases
  28. Altmetric Badge
    Chapter 59 Fugitive-search games on graphs and related parameters
  29. Altmetric Badge
    Chapter 60 New approximation results on graph matching and related problems
  30. Altmetric Badge
    Chapter 61 New lower bounds and hierarchy results for restricted branching programs
  31. Altmetric Badge
    Chapter 62 On-line algorithms for satisfiability problems with uncertainty
  32. Altmetric Badge
    Chapter 63 NC algorithms for antidirected hamiltonian paths and cycles in tournaments
  33. Altmetric Badge
    Chapter 64 Directed path graph isomorphism
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

wikipedia
11 Wikipedia pages

Citations

dimensions_citation
1 Dimensions

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.
Title
Graph-Theoretic Concepts in Computer Science
Published by
Springer Berlin Heidelberg, January 2006
DOI 10.1007/3-540-59071-4
ISBNs
978-3-54-059071-2, 978-3-54-049183-5
Editors

Mayr, Ernst W., Schmidt, Gunther, Tinhofer, Gottfried

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 %
Student > Doctoral Student 1 50%
Professor > Associate Professor 1 50%
Readers by discipline Count As %
Environmental Science 1 50%
Computer Science 1 50%