Fast Parallel Algorithms for the Subgraph Homophormism and the Subgraph Isomorphism Problem for Classes of Planat Graphs

No abstract is available for this paper.

• Publication year

  1987

• Venue

  Foundations of Software Technology and Theoretical Computer Science

• Publication date

  1987-12-17

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/3-540-18625-5_44
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Graph Theory

  2016cited by this paper
• Subgraph Isomorphism for Biconnected Outerplanar Graphs in Cubic Time

  1989cited by this paper
• Parallel computational geometry

  1988cited by this paper
• Subtree Isomorphism and Bipartite Perfect Matching are Mutually $NC$-Reducible

  1986cited by this paper
• Parallel Machines and their Communication Theoretical Limits

  1986cited by this paper
• Characterization and recognition of partial 3-trees

  1986cited by this paper
• Parallel tree contraction and its application

  1985cited by this paper
• Parallel Sorting Algorithms

  1985cited by this paper
• An Approach to the Subgraph Homeomorphism Problem

  1985influential reference
• On partitioning polygons

  1985cited by this paper
• Surveys in combinatorics 1985: Graph minors – a survey

  1985cited by this paper
• Disjoint Paths—A Survey

  1985cited by this paper
• Parallel graph algorithms

  1984influential reference
• Finding Biconnected Components and Computing Tree Functions in Logarithmic Parallel Time (Extended Summary)

  1984cited by this paper
• Simulation of Parallel Random Access Machines by Circuits

  1984influential reference
• The Classifikation of Problems which have Fast Parallel Algorithms

  1983cited by this paper
• The subgraph isomorphism problem for outerplanar graphs

  1982cited by this paper
• The NP-Completeness Column: An Ongoing Guide

  1982cited by this paper
• Johnson: "computers and intractability

  1979cited by this paper
• The pebbling problem is complete in polynomial space

  1979cited by this paper
• On Simultaneous Resource Bounds (Preliminary Version)

  1979cited by this paper
• Linear algorithms to recognize outerplanar and maximal outerplanar graphs

  1979cited by this paper
• On uniform circuit complexity

  1979cited by this paper
• The Directed Subgraph Homeomorphism Problem

  1978cited by this paper
• Subtree Isomorphism in O(n5/2)

  1978cited by this paper
• Applications of a planar separator theorem

  1977cited by this paper
• An Analysis of a Good Algorithm for the Subtree Problem

  1977cited by this paper
• The Design and Analysis of Computer Algorithms

  1974cited by this paper
• Planar Permutation Graphs

  1967cited by this paper

• A Polynomial-Time Algorithm for Subgraph Isomorphism of Two-Connected Series-Parallel Graphs

  1988cites this paper