Strong articulation points and strong bridges in large scale graphs (Q270023): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: DBLP publication ID (P1635): journals/algorithmica/FirmaniGILS16, #quickstatements; #temporary_batch_1731483406851
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: On Finding Lowest Common Ancestors in Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominators in Linear Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: The tree Constraint / 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: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / 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: Testing 2-Vertex Connectivity and Computing Pairs of Vertex-Disjoint s-t Paths in Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted arc-connectivity of digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501349 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominators, Directed Bipolar Orders, and Independent Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Dominators in Practice / 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: A fast algorithm for finding dominators in a flowgraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiency of a Good But Not Linear Set Union Algorithm / 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: Applications of Path Compression on Balanced Trees / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/algorithmica/FirmaniGILS16 / rank
 
Normal rank

Latest revision as of 08:36, 13 November 2024

scientific article
Language Label Description Also known as
English
Strong articulation points and strong bridges in large scale graphs
scientific article

    Statements

    Strong articulation points and strong bridges in large scale graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    6 April 2016
    0 references
    graph algorithms
    0 references
    graph connectivity
    0 references
    strong articulation points
    0 references
    strong bridges
    0 references
    large scale graphs
    0 references
    0 references
    0 references

    Identifiers