Finding Strong Bridges and Strong Articulation Points in Linear Time

From MaRDI portal

Revision as of 21:47, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3066153

Jump to:navigation, search

DOI10.1007/978-3-642-17458-2_14zbMath1311.05190OpenAlexW1545325081WikidataQ61609480 ScholiaQ61609480MaRDI QIDQ3066153

Federico Santaroni, Luigi Laura, Giuseppe F. Italiano

Publication date: 8 January 2011

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-17458-2_14

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

2-edge-twinless blocks ⋮ Finding strong bridges and strong articulation points in linear time

This page was built for publication: Finding Strong Bridges and Strong Articulation Points in Linear Time

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3066153&oldid=16120233"