The Minset-Poset Approach to Representations of Graph Connectivity
From MaRDI portal
Publication:4962223
DOI10.1145/2764909zbMath1398.05198OpenAlexW2342702536MaRDI QIDQ4962223
Publication date: 30 October 2018
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2764909
Analysis of algorithms (68W40) Combinatorics of partially ordered sets (06A07) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (4)
2-vertex connectivity in directed graphs ⋮ Minimum Cuts and Sparsification in Hypergraphs ⋮ On 2-strong connectivity orientations of mixed graphs and related problems ⋮ Dynamic Dominators and Low-High Orders in DAGs
This page was built for publication: The Minset-Poset Approach to Representations of Graph Connectivity
