Solving problems for maximal reducible flowgraphs

MaRDI QIDQ2816047zbMATH OpenFDO

Authors O. Vernet, Lilian Markenzon

Publication date 1 July 2016

Full work available at URL http://www.sciencedirect.com/science/article/pii/S1571065305800940?np=y

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Solving problems for maximal reducible flowgraphs.
• scientific article; zbMATH DE number 1439470
• An efficient algorithm for finding maximum cycle packings in reducible flow graphs
• Algorithms and Computation
• Flow hypergraph reducibility

Cited in

(8)

• Solving problems for maximal reducible flowgraphs.
• An efficient algorithm for finding maximum cycle packings in reducible flow graphs
• Folklore confirmed
• A Minimax Arc Theorem for Reducible Flow Graphs
• Flow Hypergraph Reducibility
• scientific article; zbMATH DE number 1439470 (Why is no real title available?)
• Algorithms and Computation
• Flow hypergraph reducibility

This page was built for publication: Solving problems for maximal reducible flowgraphs

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