Problems of synthesis of connected networks with respect to isomorphic subgraphs (Q2574245): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Some Recent Advances in Network Flows / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On dual minimum cost flow algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Faster Strongly Polynomial Minimum Cost Flow Algorithm / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Survivable networks, linear programming relaxations and the parsimonious property / rank | |||
Normal rank | |||
Latest revision as of 13:04, 11 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Problems of synthesis of connected networks with respect to isomorphic subgraphs |
scientific article |
Statements
Problems of synthesis of connected networks with respect to isomorphic subgraphs (English)
0 references
18 November 2005
0 references
network synthesis
0 references
isomorphism of graphs
0 references
cuts
0 references
tree
0 references
matching
0 references
Shannon game
0 references
planar graph
0 references
