Sparse certificates for 2-connectivity in directed graphs (Q1676306): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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.tcs.2017.06.015 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2683784293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / 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: Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs / 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: 2-Connectivity in Directed Graphs: An Experimental Study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549695 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal Flow Through a Network / 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: Approximating the Smallest 2-Vertex Connected Spanning Subgraph of a Directed Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-Vertex Connectivity in Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-Edge Connectivity in Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong Connectivity in Directed Graphs under Failures, with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominator Tree Certification and Divergent Spanning Trees / 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 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: A Rounding by Sampling Approach to the Minimum Size k-Arc Connected Subgraph Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Aspects of Graph Connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:51, 14 July 2024

scientific article
Language Label Description Also known as
English
Sparse certificates for 2-connectivity in directed graphs
scientific article

    Statements

    Sparse certificates for 2-connectivity in directed graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    6 November 2017
    0 references
    graph algorithms
    0 references
    connectivity
    0 references
    directed graph
    0 references
    dominators
    0 references
    flow graph
    0 references
    large-scale graphs
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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