A multi-threading algorithm to detect and remove cycles in vertex- and arc-weighted digraph
From MaRDI portal
Publication:2633178
DOI10.3390/A10040115zbMATH Open1461.05207OpenAlexW2761683778MaRDI QIDQ2633178FDOQ2633178
Authors: Huanqing Cui, Jian Niu, Chuanai Zhou, Minglei Shu 
Publication date: 8 May 2019
Published in: Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/a10040115
Recommendations
- A parallel algorithm for eliminating cycles in undirected graphs
- scientific article; zbMATH DE number 1751903
- scientific article; zbMATH DE number 2089184
- A new approach to incremental cycle detection and related problems
- DTCPP - A heuristic program for testing decyclization in directed graphs and its isomorphic image by using combinatorial approach
Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85) Paths and cycles (05C38)
Cites Work
- Large degree vertices in longest cycles of graphs. I
- Heavy subgraph conditions for longest cycles to be heavy in graphs
- Cycles through specified vertices in triangle-free graphs
- Depth-first search is inherently sequential
- Finding strongly connected components in distributed graphs
- A survey on Hamilton cycles in directed graphs
- A New Approach to Incremental Cycle Detection and Related Problems
- Incremental cycle detection, topological ordering, and strong component maintenance
- A shortest cycle for each vertex of a graph
- Weighted dependency graphs
- On the Number of Cycles in a Graph with Restricted Cycle Lengths
Uses Software
This page was built for publication: A multi-threading algorithm to detect and remove cycles in vertex- and arc-weighted digraph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2633178)
