|
Diskretnyi Analiz i Issledovanie Operatsii, 2011, Volume 18, Issue 2, Pages 64–74
(Mi da647)
|
|
|
|
This article is cited in 7 scientific papers (total in 7 papers)
Optimal Eulerian coverings with ordered enclosing for plane graphs
T. A. Panyukova South Ural State University, Cheliabinsk, Russia
Abstract:
One of the optimal criteria for sequences of trails with ordered enclosing is the length of additional segments between the end of current trail and the beginning of the next one. Known algorithms for constructing such the covering do not consider this criterion. This paper is devoted to an algorithm for constructing of Eulerian covering with ordered enclosing and minimal value of indicated criterion. Ill. 1, bibliogr. 12.
Keywords:
plane graph, trail, covering, path, ordered enclosing.
Received: 24.08.2010 Revised: 13.11.2010
Citation:
T. A. Panyukova, “Optimal Eulerian coverings with ordered enclosing for plane graphs”, Diskretn. Anal. Issled. Oper., 18:2 (2011), 64–74
Linking options:
https://www.mathnet.ru/eng/da647 https://www.mathnet.ru/eng/da/v18/i2/p64
|
Statistics & downloads: |
Abstract page: | 316 | Full-text PDF : | 87 | References: | 49 | First page: | 4 |
|