Sequential and parallel algorithms for embedding problems on classes of partial k-trees (Q5054759): 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-58218-5_16 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1515227792 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Finding Embeddings in a <i>k</i>-Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easy problems for tree-decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3795218 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time algorithm for finding tree-decompositions of small treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / 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: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subtree isomorphism is in random NC / rank
 
Normal rank
Property / cites work
 
Property / cites work: The parallel complexity of tree embedding problems (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential and parallel algorithms for embedding problems on classes of partial k-trees / 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: Subtree isomorphism is NC reducible to bipartite perfect matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3804190 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of finding iso- and other morphisms for partial \(k\)- trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subtree Isomorphism in O(n5/2) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On simple characterizations of k-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. III. Planar tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / 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 02:07, 31 July 2024

scientific article; zbMATH DE number 7631696
Language Label Description Also known as
English
Sequential and parallel algorithms for embedding problems on classes of partial k-trees
scientific article; zbMATH DE number 7631696

    Statements

    Sequential and parallel algorithms for embedding problems on classes of partial k-trees (English)
    0 references
    0 references
    0 references
    9 December 2022
    0 references

    Identifiers

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