The parallel complexity of tree embedding problems (extended abstract) (Q5096766): 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.1007/3-540-55210-3_170 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2108744165 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Parallel Evaluation of General Arithmetic Expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonconstructive tools for proving polynomial-time decidability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallelism in random access machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subtree isomorphism is in random NC / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Computational Complexity of Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing a perfect matching is in random NC / rank
 
Normal rank
Property / cites work
 
Property / cites work: Processor Efficient Parallel Algorithms for the Two Disjoint Paths Problem and for Finding a Kuratowski Homeomorph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subtree isomorphism is NC reducible to bipartite perfect matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subtree Isomorphism in O(n5/2) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching is as easy as matrix inversion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XIII: The disjoint paths problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XV: Giant steps / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Parallel Biconnectivity Algorithm / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:43, 29 July 2024

scientific article; zbMATH DE number 7573017
Language Label Description Also known as
English
The parallel complexity of tree embedding problems (extended abstract)
scientific article; zbMATH DE number 7573017

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references