Efficient parallel recognition algorithms of cographs and distance hereditary graphs (Q1345961): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Parallel algorithms for cographs and parity graphs with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning read-once formulas with queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-hereditary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complement reducible graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Recognition Algorithm for Cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient parallel recognition algorithms of cographs and distance hereditary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallelism in random access machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Operational Statistics. I. Basic Concepts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4120519 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3666625 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completely separable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4013534 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial characterization of read-once formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient parallel algorithm for planarity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel ear decomposition search (EDS) and st-numbering in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3218157 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Finding Lowest Common Ancestors: Simplification and Parallelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a property of the class of n-colorable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(logn) parallel connectivity algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dacey Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Parallel Biconnectivity Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel algorithm for cograph recognition with applications / rank
 
Normal rank

Revision as of 11:19, 23 May 2024

scientific article
Language Label Description Also known as
English
Efficient parallel recognition algorithms of cographs and distance hereditary graphs
scientific article

    Statements

    Efficient parallel recognition algorithms of cographs and distance hereditary graphs (English)
    0 references
    0 references
    9 October 1995
    0 references
    cographs
    0 references
    hereditary graphs
    0 references

    Identifiers