An effective structured approach to finding optimal partitions of networks (Q1164549)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An effective structured approach to finding optimal partitions of networks |
scientific article; zbMATH DE number 3763692
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An effective structured approach to finding optimal partitions of networks |
scientific article; zbMATH DE number 3763692 |
Statements
An effective structured approach to finding optimal partitions of networks (English)
0 references
1982
0 references
edge-valued node-weighted finite connected simple graph
0 references
disjoint subgraphs
0 references
weight constraint
0 references
three-stage procedure
0 references
depth-first search
0 references
branch-and-bound structure
0 references
optimality theorem
0 references
adjacent set
0 references
combinatorial programming
0 references
discrete optimization
0 references
essential block
0 references
expansion tree
0 references
optimal network partitioning
0 references
0 references
