Sequential and parallel algorithms on compactly represented chordal and strongly chordal graphs (Q5048948): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A simple parallel tree contraction algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel algorithms for evaluating sequences of set-manipulation operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterisation of rigid circuit graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The parallel solution of domination problems on chordal and strongly chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parallel algorithm for computing Steiner trees in strongly chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees of acyclicity for hypergraphs and relational database schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of strongly chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination, independent domination, and duality in strongly chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for a special case of disjoint set union / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intersection graphs of subtrees in trees are exactly the chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3806672 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulated graphs and the elimination process / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(logn) parallel connectivity algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonredundant 1’s in $\Gamma $-Free Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner trees, connected domination and strongly chordal graphs / rank
 
Normal rank

Revision as of 19:32, 30 July 2024

scientific article; zbMATH DE number 7614491
Language Label Description Also known as
English
Sequential and parallel algorithms on compactly represented chordal and strongly chordal graphs
scientific article; zbMATH DE number 7614491

    Statements

    Sequential and parallel algorithms on compactly represented chordal and strongly chordal graphs (English)
    0 references
    0 references
    9 November 2022
    0 references

    Identifiers

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