Effective search for all maximal mean cycles in a graph

MaRDI QIDQ2567653zbMATH OpenFDO

Authors Vasiliĭ N. Lebedev

Publication date 11 October 2005

Published in Journal of Computer and Systems Sciences International (Search for Journal in Brave)

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Maximum cycle-means of weighted digraphs
• Algorithms for finding the minimum cycle mean in the weighted directed graph
• A note on finding minimum mean cycle
• scientific article; zbMATH DE number 1534586
• Approximating the minimum cycle mean

Cited in

(5)

• An efficient algorithm for searching implicit AND/OR graphs with cycles
• Maximum cycle-means of weighted digraphs
• A note on finding minimum mean cycle
• scientific article; zbMATH DE number 1247175 (Why is no real title available?)
• scientific article; zbMATH DE number 1534586 (Why is no real title available?)

This page was built for publication: Effective search for all maximal mean cycles in a graph

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