scientific article; zbMATH DE number 176397

zbMATH Open0798.68131MaRDI QIDQ4035548FDOQ4035548

Authors: Arlene F. Machado, Clovis Perin 

Publication date: 18 May 1993

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 857448
• The computational complexity of optimal blocking of vertices in the digraph
• scientific article; zbMATH DE number 3980537
• Progress in selection
• The \(S\)-digraph optimization problem and the greedy algorithm

zbMATH Keywords

digraphiterative algorithmsselection problem

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph theory (including graph drawing) in computer science (68R10)

Cited In (4)

• The computational complexity of optimal blocking of vertices in the digraph
• The best choice problem for upward directed graphs
• The \(\beta\)-assignment problem in general graphs
• On the General Position Subset Selection Problem

This page was built for publication:

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