scientific article; zbMATH DE number 432788

zbMATH Open0800.68633MaRDI QIDQ3138919FDOQ3138919

Authors: Arkady Kanevsky 

Publication date: 20 September 1994

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

zbMATH Keywords

connectivityminimum size separating vertex sets

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cited In (5)

• Improved algorithms for graph four-connectivity
• Finding all minimum-size separating vertex sets in a graph
• Efficient enumeration of all minimal separators in a graph
• Multicommodity network design with discrete node costs
• Suboptimal cuts: their enumeration, weight and number (extended abstract)

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 Q3138919)