Efficiently parallelizable problems on a class of decomposable graphs (Q1765226): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.jcss.2004.08.003 / rank
Normal rank
 
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/j.jcss.2004.08.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2061700222 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple parallel tree contraction algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time algorithms for NP-hard problems restricted to partial k- trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time computation of optimal subgraphs of decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel algorithms for series parallel graphs and graphs with treewidth two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient parallel algorithms for series parallel graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binary tree algebraic computation and parallel algorithms for simple graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of Efficiently Parallel Solvable Problems on Distance-Hereditary Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023519 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularity and locality in \(k\)-terminal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time computability of combinatorial problems on series-parallel graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Recognition of Series Parallel Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3822197 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3826618 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.JCSS.2004.08.003 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:41, 11 December 2024

scientific article
Language Label Description Also known as
English
Efficiently parallelizable problems on a class of decomposable graphs
scientific article

    Statements

    Efficiently parallelizable problems on a class of decomposable graphs (English)
    0 references
    0 references
    23 February 2005
    0 references
    Decomposable graphs
    0 references
    Parallel algorithms
    0 references
    PRAM
    0 references
    Subgraph optimization problems
    0 references
    Rooted trees
    0 references
    Series-parallel graphs
    0 references

    Identifiers

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