A New Algorithm for Finding Minimal Cycle-Breaking Sets of Turns in a Graph

DOI10.7155/JGAA.00134zbMATH Open1161.68682OpenAlexW2155484437MaRDI QIDQ5301401FDOQ5301401

Authors: Lev B. Levitin, M. G. Karpovsky, Mehmet Mustafa, Lev Zakrevski 

Publication date: 19 January 2009

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/55418

Recommendations

• scientific article; zbMATH DE number 1247175
• scientific article; zbMATH DE number 4010557
• Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs
• New Approximation Algorithms for Minimum Cycle Bases of Graphs
• New approximation algorithms for minimum cycle bases of graphs
• An algorithm for min-cost edge-disjoint cycles and its applications
• Automata, Languages and Programming
• Algorithms for finding minimum fundamental cycle bases in graphs
• New approximation algorithms for the minimum cycle cover problem
• New approximation algorithms for the minimum cycle cover problem

zbMATH Keywords

undirected graphdeadlock-free wormhole routing

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

This page was built for publication: A New Algorithm for Finding Minimal Cycle-Breaking Sets of Turns in a Graph

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