Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs (Q3452820): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q61609309 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1509.02841 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominators in Linear Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Time Algorithms for Dominators and Other Path-Evaluation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Minimum-Size <i>k</i>-Connected Spanning Subgraphs via Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the smallest <i>k</i> -edge connected spanning subgraph by LP-rounding / 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: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-Vertex Connectivity in Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding strong bridges and strong articulation points in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the 2-blocks of directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating node connectivity problems via set covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Rounding by Sampling Approach to the Minimum Size k-Arc Connected Subgraph Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Aspects of Graph Connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-disjoint spanning trees and depth-first search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768327 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time \(\frac{5}{3}\)-approximation for the minimum strongly-connected spanning subgraph problem / rank
 
Normal rank

Latest revision as of 02:15, 11 July 2024

scientific article
Language Label Description Also known as
English
Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs
scientific article

    Statements

    Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    19 November 2015
    0 references

    Identifiers

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