Faster algorithms for computing maximal 2-connected subgraphs in sparse directed graphs

Shiri Chechik, Thomas Dueholm Hanseny, Giuseppe F. Italiano, Veronika Loitzenbauer, Nikos Parotsidis

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

18 Scopus citations

Fingerprint

Dive into the research topics of 'Faster algorithms for computing maximal 2-connected subgraphs in sparse directed graphs'. Together they form a unique fingerprint.

Mathematics

Engineering & Materials Science