Determining uni-connectivity in directed graphs

DOI10.1016/0020-0190(93)90261-7zbMath0787.68076OpenAlexW2013688836MaRDI QIDQ1313717

Adam L. Buchsbaum, Martin C. Carlisle

Publication date: 24 February 1994

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(93)90261-7

zbMATH Keywords

chordscontractionconnectivitydirected graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (6)

On the Complexity of Singly Connected Vertex Deletion ⋮ Addendum to ``An \(O(|V|^{2})\) algorithm for single connectedness ⋮ Make a graph singly connected by edge orientations ⋮ Arity bounds in first-order incremental evaluation and definition of polynomial time database queries ⋮ On the complexity of singly connected vertex deletion ⋮ On testing single connectedness in directed graphs and some related problems

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: Determining uni-connectivity in directed graphs