This article is cited in 1 scientific paper (total in 1 paper)
On one twocriterial graph problem
V. G. Vizing
It is supposed that each edge of a graph has two number characteristics: the length and the width. The sum of the lengths of the edges of a subgraph is called the length of the subgraph, the maximal width of the edges of subgraph is called the width of subgraph. The length of subgraph is a negative characteristic of subgraph, the width of subgraph is its positive characteristic. The certain kinds of subgraphs are called admissible. A two-criterial problem of searching a Pareto optimal admissible subgraph is considered. Bibl. 5.
admissible subgraph, indicator of subgraph's quality, Pareto optimal subgraph.
PDF file (227 kB)
V. G. Vizing, “On one twocriterial graph problem”, Diskretn. Anal. Issled. Oper., 16:5 (2009), 34–40
Citation in format AMSBIB
\paper On one twocriterial graph problem
\jour Diskretn. Anal. Issled. Oper.
Citing articles on Google Scholar:
Related articles on Google Scholar:
This publication is cited in the following articles:
V. G. Vizing, “Multicriterial graph problems with MAXMIN criterion”, J. Appl. Industr. Math., 6:2 (2012), 256–260
|Number of views:|