On parallel complexity of the subgraph homeomorphism of the subgraph isomorphism problem for classes of planar graphs (Q1262768): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0304-3975(89)90127-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2019615222 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization and Recognition of Partial 3-Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden minors characterization of partial 3-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal parallel algorithms for computing convex hulls and for sorting / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approach to the subgraph homeomorphism problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correction: Parallel Merge Sort / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3311653 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5545841 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The directed subgraph homeomorphism problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgraph isomorphism for biconnected outerplanar graphs in cubic time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear algorithms to recognize outerplanar and maximal outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint Paths—A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. V. Excluding a planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3694703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3683547 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3709880 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of a Good Algorithm for the Subtree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On uniform circuit complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(logn) parallel connectivity algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulation of Parallel Random Access Machines by Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: The subgraph isomorphism problem for outerplanar graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:41, 20 June 2024

scientific article
Language Label Description Also known as
English
On parallel complexity of the subgraph homeomorphism of the subgraph isomorphism problem for classes of planar graphs
scientific article

    Statements

    On parallel complexity of the subgraph homeomorphism of the subgraph isomorphism problem for classes of planar graphs (English)
    0 references
    0 references
    0 references
    1989
    0 references
    See the review in Zbl 0643.68086.
    0 references
    0 references
    parallel algorithms
    0 references
    subgraph homeomorphism
    0 references
    subgraph isomorphism
    0 references
    planar graphs
    0 references
    NC algorithm
    0 references
    0 references