|
Diskretnyi Analiz i Issledovanie Operatsii, 2009, Volume 16, Issue 5, Pages 34–40
(Mi da585)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
On one twocriterial graph problem
V. G. Vizing Odessa, Ukraine
Abstract:
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.
Keywords:
admissible subgraph, indicator of subgraph's quality, Pareto optimal subgraph.
Received: 23.04.2009
Citation:
V. G. Vizing, “On one twocriterial graph problem”, Diskretn. Anal. Issled. Oper., 16:5 (2009), 34–40
Linking options:
https://www.mathnet.ru/eng/da585 https://www.mathnet.ru/eng/da/v16/i5/p34
|
Statistics & downloads: |
Abstract page: | 474 | Full-text PDF : | 141 | References: | 61 | First page: | 3 |
|