↓ 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 27 Optimal parallel algorithms for sparse graphs
  3. Altmetric Badge
    Chapter 28 Finding minimally weighted subgraphs
  4. Altmetric Badge
    Chapter 29 On the complexity of some coloring games
  5. Altmetric Badge
    Chapter 30 A generalized best-first search method in graphs
  6. Altmetric Badge
    Chapter 31 Avoiding matrix multiplication
  7. Altmetric Badge
    Chapter 32 Induced subraph isomorphism for cographs is NP-complete
  8. Altmetric Badge
    Chapter 33 On feedback problems in planar digraphs
  9. Altmetric Badge
    Chapter 34 Recognizing binary hamming graphs in O ( n 2 log n ) time
  10. Altmetric Badge
    Chapter 35 Vertex-disjoint trees and boundary single-layer routing
  11. Altmetric Badge
    Chapter 36 Bounds on the quality of approximate solutions to the group Steiner problem
  12. Altmetric Badge
    Chapter 37 Two polynomial problems in PLA folding
  13. Altmetric Badge
    Chapter 38 The VLSI layout problem in various embedding models
  14. Altmetric Badge
    Chapter 39 Approximating the minimum net expansion: Near optimal solutions to circuit partitioning problems
  15. Altmetric Badge
    Chapter 40 Deterministic message routing in faulty hypercubes
  16. Altmetric Badge
    Chapter 41 On complexity of a message-routing strategy for multicomputer systems
  17. Altmetric Badge
    Chapter 42 Embeddings of treelike graphs into 2-dimensional meshes
  18. Altmetric Badge
    Chapter 43 Diagnosis of t/s-diagnosable systems
  19. Altmetric Badge
    Chapter 44 Deciding 1-solvability of distributed task is NP-hard
  20. Altmetric Badge
    Chapter 45 Remarks on some concurrency measures
  21. Altmetric Badge
    Chapter 46 On the rectilinear art gallery problem algorithmic aspects
  22. Altmetric Badge
    Chapter 47 Separation problems and circular arc systems
  23. Altmetric Badge
    Chapter 48 Genus of orders and lattices
  24. Altmetric Badge
    Chapter 49 Comparing the expressibility of two languages formed using NP-complete graph operators
  25. Altmetric Badge
    Chapter 50 Decomposition of linear recursive logic programs
  26. Altmetric Badge
    Chapter 51 On the transition graphs of automata and grammars
  27. Altmetric Badge
    Chapter 52 Algebraic approach to graph transformation based on single pushout derivations
Attention for Chapter 37: Two polynomial problems in PLA folding
Altmetric Badge

Citations

dimensions_citation
2 Dimensions

Readers on

mendeley
1 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
Two polynomial problems in PLA folding
Chapter number 37
Book title
Graph-Theoretic Concepts in Computer Science
Published by
Springer, Berlin, Heidelberg, June 1990
DOI 10.1007/3-540-53832-1_37
Book ISBNs
978-3-54-053832-5, 978-3-54-046310-8
Authors

Claudio Arbib, Arbib, Claudio

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 1 100%

Demographic breakdown

Readers by professional status Count As %
Professor 1 100%
Readers by discipline Count As %
Decision Sciences 1 100%