scientific article; zbMATH DE number 1500572

zbMATH Open0956.05096MaRDI QIDQ4501593FDOQ4501593

Authors: Hong Shen, Keqin Li, S. Q. Zheng 

Publication date: 12 March 2001

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

Recommendations

• On disconnected cuts and separators
• Split cuts from sparse disjunctions
• Publication:4207787
• An elementary solution to the problem of splitting separatrices
• An algorithm for the separation of two-row cuts
• Obtaining splits from cut sets of tight spans
• Simple enumeration of minimal cutsets separating 2 vertices in a class of undirected planar graphs
• On the minimum cut separator problem
• Algorithms to Separate ${\{0,\frac{1}{2}\}}$ -Chvátal-Gomory Cuts

zbMATH Keywords

algorithmsdata structurestime complexitycutsetsseparators

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Cited In (11)

• Title not available (Why is that?)
• Representing a concept lattice by a graph
• Title not available (Why is that?)
• Space-optimal, backtracking algorithms to list the minimal vertex separators of a graph
• On the maximum weight minimal separator
• Finding all minimum-size separating vertex sets in a graph
• On the minimum cut separator problem
• On the maximum weight minimal separator
• On disconnected cuts and separators
• A local approach to concept generation
• Algorithms and formulations for the minimum cut separator 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 Q4501593)