Optimal algorithm for converting an acyclic digraph to a cluster

DOI10.17223/20710410/54/4MaRDI QIDQ5068488zbMATH OpenFDO

Authors G. Sh. Tsitsiashvili, M. A. Osipova

Publication date 6 April 2022

Full work available at URL http://mathnet.ru/eng/pdm754

zbMATH Keywords

acyclic digraphbipartite digraphclusterfeedbackHamiltonian cycleminimal edge cover

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 4045794
• Incrementing bipartite digraph edge-connectivity
• Publication:3478420
• An algorithm to increase the node-connectivity of a digraph by one
• Making bidirected graphs strongly connected

Cites work

• Clustering algorithm of graphs
• Depth-First Search and Linear Graph Algorithms
• Introduction to algorithms.

This page was built for publication: Optimal algorithm for converting an acyclic digraph to a cluster

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