Finding 3-shredders efficiently

DOI10.1145/1125994.1125996MaRDI QIDQ2944504zbMATH OpenOpenAlexFDO

Authors Rajneesh Hegde

Publication date 2 September 2015

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1125994.1125996

zbMATH Keywords

depth-first searchvertex cutshredderfour-connected

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40)

Recommendations

• On the number of shredders
• On \((t,k)\)-shredders in \(k\)-connected graphs.
• k-shredders ink-connected graphs
• 9-shredders in 9-connected graphs
• 8-shredders in 8-connected graphs

Cited in

(1)

• On the number of shredders

This page was built for publication: Finding 3-shredders efficiently

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2944504)