scientific article; zbMATH DE number 3887732

MaRDI QIDQ3222226zbMATH OpenFDO

Authors Wieslaw Stanczak

Publication date 1984

zbMATH Keywords

cutsfinite complete undirected graphterminal capacity matrix

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)

Recommendations

• Minimal graph cuts on network subgraphs
• Decomposition of a network into minimally connected parts
• scientific article; zbMATH DE number 3891429
• A better sets approach algorithm for the determination of component minimal complete subgraph
• A fast algorithm for finding the compact sets

Cited in

(5)

• The optimal partitioning of networks
• A better sets approach algorithm for the determination of component minimal complete subgraph
• 0-1 algebraic approach algorithm for the determination of component minimal complete subgraph
• Sets approach algorithms for determination of component minimal complete subgraph
• Decomposition of a network into minimally connected parts

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