Determining uni-connectivity in directed graphs

DOI10.1016/0020-0190(93)90261-7MaRDI QIDQ1313717zbMATH OpenOpenAlexFDO

Authors 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 algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Connected graph searching for unicyclic graphs
• Finding the edge connectivity of directed graphs
• On testing single connectedness in directed graphs and some related problems
• Connectivity in directed hypergraphs
• scientific article; zbMATH DE number 3902695
• scientific article; zbMATH DE number 1743821
• The connectivity of directed circulant graphs
• On the connectivity of unit distance graphs
• On finding the strongly connected components in a directed graph
• Algebraic connectivity of directed graphs

Cited in

(7)

• Arity bounds in first-order incremental evaluation and definition of polynomial time database queries
• 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
• An \(O(|V|^2)\) algorithm for single connectedness
• On the complexity of singly connected vertex deletion
• On testing single connectedness in directed graphs and some related problems

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

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