Problems of synthesis of connected networks with respect to isomorphic subgraphs

Authors:
F. A. Sharifov
Affiliations:
Cybernetics Institute, National Academy of Sciences of Ukraine, Kiev, Ukraine
Venue:
Cybernetics and Systems Analysis
Year:
2004

Citing 5
Cited 0

Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
Some recent advances in network flows

SIAM Review
A faster strongly polynomial minimum cost flow algorithm

Operations Research
Survivable networks, linear programming relaxations and the parsimonious property

Mathematical Programming: Series A and B
Combinatorial optimization

Combinatorial optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper deals with problems of minimum-cost network synthesis under the condition that at least one pair of nodes remains connected by a path after eliminating all the edges of a subgraph isomorphic to a given graph. The existence of solutions of such problems is investigated for different isomorphic subgraphs.