Approximating Transitive Reductions for Directed Networks (Q3183442): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The Transitive Reduction of a Directed Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inferring (biological) signal transduction networks via transitive reductions of directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5595648 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Several Graph Augmentation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple derivation of edmonds' algorithm for optimum branchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Minimum Equivalent Digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On strongly connected digraphs with bounded cycle length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252419 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Finding a Minimum Equivalent Graph of a Digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768327 / rank
 
Normal rank

Latest revision as of 02:25, 2 July 2024

scientific article
Language Label Description Also known as
English
Approximating Transitive Reductions for Directed Networks
scientific article

    Statements