RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor
Subscription

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Diskretn. Anal. Issled. Oper., 2009, Volume 16, Number 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.

Full text: PDF file (227 kB)
References: PDF file   HTML file

Bibliographic databases:
UDC: 519.178
Received: 23.04.2009

Citation: V. G. Vizing, “On one twocriterial graph problem”, Diskretn. Anal. Issled. Oper., 16:5 (2009), 34–40

Citation in format AMSBIB
\Bibitem{Viz09}
\by V.~G.~Vizing
\paper On one twocriterial graph problem
\jour Diskretn. Anal. Issled. Oper.
\yr 2009
\vol 16
\issue 5
\pages 34--40
\mathnet{http://mi.mathnet.ru/da585}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=2590753}
\zmath{https://zbmath.org/?q=an:1249.90302}


Linking options:
  • http://mi.mathnet.ru/eng/da585
  • http://mi.mathnet.ru/eng/da/v16/i5/p34

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. V. G. Vizing, “Multicriterial graph problems with MAXMIN criterion”, J. Appl. Industr. Math., 6:2 (2012), 256–260  mathnet  crossref  mathscinet  zmath
  • Дискретный анализ и исследование операций
    Number of views:
    This page:348
    Full text:117
    References:37
    First page:3

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020