Finding and using directed cuts of real graphs of algorithms
type: Item
instance of: scholarly article
title: Finding and using directed cuts of real graphs of algorithms
zbMATH Open document ID: 0973.68513
published in: Programming and Computer Software
publication date: 2001-11-27T00:00:00Z
Mathematics Subject Classification ID: 68N19
zbMATH DE Number: 1592203
zbMATH Keywords: directed cuts of graphs
zbMATH Keywords: multiprocessor computing systems
MaRDI profile type: Publication
Recommended article: Hardness of cut problems in directed graphs
Recommended article: A Faster Algorithm for Finding the Minimum Cut in a Directed Graph
Recommended article: Approximation and Online Algorithms
Recommended article: On the hardness of finding near-optimal multicuts in directed acyclic graphs
Recommended article: Iterative algorithms for generating minimal cutsets in directed graphs
Recommended article: Algorithms for the determination of cutsets in a hypergraph
Recommended article: An Almost Linear-Time Algorithm for Graph Realization
Recommended article: Q4221374
Recommended article: Combinatorial approximation algorithms for the maximum directed cut problem
author: A. V. Frolov
description: scientific article; zbMATH DE number 1592203