Finding and using directed cuts of real graphs of algorithms

MaRDI QIDQ5930916zbMATH OpenFDO

Authors A. V. Frolov

Publication date 27 November 2001

Published in Programming and Computer Software (Search for Journal in Brave)

zbMATH Keywords

directed cuts of graphsmultiprocessor computing systems

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Recommendations

• Hardness of cut problems in directed graphs
• A Faster Algorithm for Finding the Minimum Cut in a Directed Graph
• Approximation and Online Algorithms
• On the hardness of finding near-optimal multicuts in directed acyclic graphs
• Iterative algorithms for generating minimal cutsets in directed graphs
• Algorithms for the determination of cutsets in a hypergraph
• An Almost Linear-Time Algorithm for Graph Realization
• scientific article; zbMATH DE number 1234600
• Combinatorial approximation algorithms for the maximum directed cut problem

Cited in

(6)

• Optimization of data exchange in parallel computers with distributed memory
• Sufficient conditions for the determination and use of data in the same granular parallel computation process
• scientific article; zbMATH DE number 4145933 (Why is no real title available?)
• scientific article; zbMATH DE number 3987305 (Why is no real title available?)
• Parallelization of sequential programs: distribution of arrays among processors and structurization of communications
• scientific article; zbMATH DE number 4085692 (Why is no real title available?)

This page was built for publication: Finding and using directed cuts of real graphs of algorithms

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