A fast parallel algorithm to recognize P4-sparse graphs (Q1382265): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new 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 / cites work
 
Property / cites work: The Isomorphism Problem For Directed Path Graphs and For Rooted Directed Path Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Time Algorithm for Deciding Interval Graph Isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3697033 / 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: Parallel Algorithm for Cograph Recognition with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4013534 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonicity in graphs with few \(P_ 4\)'s / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>P</i><sub>4</sub>-Reducible Graphs-Class of Uniquely Tree-Representable Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tree representation for \(P_ 4\)-sparse graphs / 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: P-Components and the Homogeneous Decomposition of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time optimization algorithms for \(P_ 4\)-sparse 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: Isomorphism Testing in Hookup Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4130999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal parallel matching algorithm for cographs / 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: Dacey Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4857805 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:48, 28 May 2024

scientific article
Language Label Description Also known as
English
A fast parallel algorithm to recognize P4-sparse graphs
scientific article

    Statements

    A fast parallel algorithm to recognize P4-sparse graphs (English)
    0 references
    0 references
    0 references
    19 August 1998
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    mobile computing
    0 references
    group-based collaboration
    0 references
    automated theorem proving
    0 references
    networking
    0 references
    scheduling
    0 references
    cluster analysis
    0 references