Efficient parallel recognition of cographs (Q2565857): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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/j.dam.2005.02.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2166708791 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel algorithms for cographs and parity graphs with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Pathwidth and Treewidth of Cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal parallel co-connectivity algorithm / 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: Efficient parallel recognition algorithms of cographs and distance hereditary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Algorithm for Cograph Recognition with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023519 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing $P_4 $-Sparse Graphs in Linear Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time recognition algorithm for \(P_{4}\)-reducible graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a class of posets and the corresponding comparability graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel recognition of complement reducible graphs and cotree construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast parallel algorithm to recognize P4-sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal path cover algorithm for cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A time-optimal solution for the path cover problem on cographs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dacey Graphs / rank
 
Normal rank

Latest revision as of 16:52, 10 June 2024

scientific article
Language Label Description Also known as
English
Efficient parallel recognition of cographs
scientific article

    Statements

    Efficient parallel recognition of cographs (English)
    0 references
    0 references
    28 September 2005
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references