Finding all minimum-size separating vertex sets in a graph

DOI10.1002/NET.3230230604MaRDI QIDQ3141110zbMATH OpenOpenAlexFDO

Authors Arkady Kanevsky

Publication date 12 December 1993

Published in Networks (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/2142/74264

zbMATH Keywords

minimum-size edge cut setsminimum-size vertex setsparallel version

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Connectivity (05C40) Parallel numerical computation (65Y05) Deterministic network models in operations research (90B10) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Efficient enumeration of all minimal separators in a graph
• scientific article; zbMATH DE number 4091549
• scientific article; zbMATH DE number 1234600
• scientific article; zbMATH DE number 3999696
• scientific article; zbMATH DE number 1500572

Cites work

• Dividing a Graph into Triconnected Components
• scientific article; zbMATH DE number 432788 (Why is no real title available?)
• scientific article; zbMATH DE number 3958744 (Why is no real title available?)
• On the structure of all minimum cuts in a network and applications

Cited in

(10)

• Efficient enumeration of all minimal separators in a graph
• Finding happiness: an analysis of the maximum happy vertices problem
• Game connectivity of graphs
• Knowledge discovery in graphs through vertex separation
• scientific article; zbMATH DE number 4145933 (Why is no real title available?)
• An algorithm for finding all thek-components of a digraph
• scientific article; zbMATH DE number 4091549 (Why is no real title available?)
• scientific article; zbMATH DE number 3999696 (Why is no real title available?)
• GENERATING ALL THE MINIMAL SEPARATORS OF A GRAPH
• A linear time algorithm to list the minimal separators of chordal graphs

This page was built for publication: Finding all minimum-size separating vertex sets in a graph

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