A comparison of three algorithms for finding fundamental cycles in a directed graph

DOI10.1002/net.3230110102zbMath0459.68030OpenAlexW2071065064MaRDI QIDQ3910009

No author found.

Publication date: 1981

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230110102

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Paths and cycles (05C38)

Related Items

Vehicle routing problem with time windows and simultaneous delivery and pick-up service based on MCPSO, On the shortest path problem with negative cost cycles, On cyclic sequence types for constructing cyclic schedules, Finding all the negative cycles in a directed graph

Cites Work

• An algorithm for finding a fundamental set of cycles of a graph
• Unnamed Item