A multi-threading algorithm to detect and remove cycles in vertex- and arc-weighted digraph

DOI10.3390/A10040115MaRDI QIDQ2633178zbMATH OpenOpenAlexFDO

Authors Huanqing Cui, Jian Niu, Chuanai Zhou, Minglei Shu

Publication date 8 May 2019

Published in Algorithms (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.3390/a10040115

zbMATH Keywords

digraphiterationmulti-threadingcycle detection and removalvertex- and arc-weighted

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85) Paths and cycles (05C38)

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

Cites work

• A new approach to incremental cycle detection and related problems
• A shortest cycle for each vertex of a graph
• A survey on Hamilton cycles in directed graphs
• Cycles through specified vertices in triangle-free graphs
• Depth-first search is inherently sequential
• Finding strongly connected components in distributed graphs
• Heavy subgraph conditions for longest cycles to be heavy in graphs
• Incremental cycle detection, topological ordering, and strong component maintenance
• Large degree vertices in longest cycles of graphs. I
• On the Number of Cycles in a Graph with Restricted Cycle Lengths
• Weighted dependency graphs

Describes a project that uses

Uses Software

• SNAP
• Pregel
• GraphX
• GPS

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)