An Almost Exact Linear Algorithm for Transformation of Chain-Cycle Graphs with Optimization of the Sum of Operation Costs

For weighted directed chain-cycle graphs, an algorithm transforming one graph into another is constructed. The algorithm runs in linear time and yields a sequence of transformations with the smallest, up to an additive error, total cost. The costs of the operations of inserting and deleting an edge...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Doklady. Mathematics 2020-09, Vol.102 (2), p.376-379
Hauptverfasser:	Gorbunov, K. Yu, Lyubetsky, V. A.
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Chains Costs Graphs Mathematics Mathematics and Statistics Optimization
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

container_end_page	379
container_issue	2
container_start_page	376
container_title	Doklady. Mathematics
container_volume	102
creator	Gorbunov, K. Yu Lyubetsky, V. A.
description	For weighted directed chain-cycle graphs, an algorithm transforming one graph into another is constructed. The algorithm runs in linear time and yields a sequence of transformations with the smallest, up to an additive error, total cost. The costs of the operations of inserting and deleting an edge segment may differ from each other and from the costs of the other operations. The additive error is estimated in terms of the operation costs.
doi_str_mv	10.1134/S1064562420050324
format	Article
fullrecord	<record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2478070949</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2478070949</sourcerecordid><originalsourceid>FETCH-LOGICAL-c268t-785cae9a7b6bbef6a39725701ad479758f9789c8dff9d2434d8f5d3a65dc66993</originalsourceid><addsrcrecordid>eNp1kEtLAzEUhYMoWKs_wF3A9WjemSzLUB9Q6KJ1PaQzSTulMxmTFK2_3gwjuhBX93Dvd86BC8AtRvcYU_awwkgwLggjCHFECTsDE8wpznIqyHnS6ZwN90twFcIeIcYTOQGnWQdnh9aFCOcfuopw0XRG-7TbOt_EXQut83DtdReSaHVsXAedhcVON11WnKqDgU9e97sA3xMOl31s2ubzh4s7A1fHdpDL3vhxX6S6cA0urD4Ec_M9p-D1cb4unrPF8umlmC2yiog8ZjLnlTZKy43YbIwVmipJuERY10wqyXOrZK6qvLZW1YRRVueW11QLXldCKEWn4G7M7b17O5oQy707-i5VloTJHEmk2EDhkaq8C8EbW_a-abU_lRiVw4fLPx9OHjJ6QmK7rfG_yf-bvgBIuX2A</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2478070949</pqid></control><display><type>article</type><title>An Almost Exact Linear Algorithm for Transformation of Chain-Cycle Graphs with Optimization of the Sum of Operation Costs</title><source>SpringerLink Journals - AutoHoldings</source><creator>Gorbunov, K. Yu ; Lyubetsky, V. A.</creator><creatorcontrib>Gorbunov, K. Yu ; Lyubetsky, V. A.</creatorcontrib><description>For weighted directed chain-cycle graphs, an algorithm transforming one graph into another is constructed. The algorithm runs in linear time and yields a sequence of transformations with the smallest, up to an additive error, total cost. The costs of the operations of inserting and deleting an edge segment may differ from each other and from the costs of the other operations. The additive error is estimated in terms of the operation costs.</description><identifier>ISSN: 1064-5624</identifier><identifier>EISSN: 1531-8362</identifier><identifier>DOI: 10.1134/S1064562420050324</identifier><language>eng</language><publisher>Moscow: Pleiades Publishing</publisher><subject>Algorithms ; Chains ; Costs ; Graphs ; Mathematics ; Mathematics and Statistics ; Optimization</subject><ispartof>Doklady. Mathematics, 2020-09, Vol.102 (2), p.376-379</ispartof><rights>Pleiades Publishing, Ltd. 2020. ISSN 1064-5624, Doklady Mathematics, 2020, Vol. 102, No. 2, pp. 376–379. © Pleiades Publishing, Ltd., 2020. Russian Text © The Author(s), 2020, published in Doklady Rossiiskoi Akademii Nauk. Matematika, Informatika, Protsessy Upravleniya, 2020, Vol. 494, pp. 26–29.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c268t-785cae9a7b6bbef6a39725701ad479758f9789c8dff9d2434d8f5d3a65dc66993</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1134/S1064562420050324$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1134/S1064562420050324$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,777,781,27905,27906,41469,42538,51300</link.rule.ids></links><search><creatorcontrib>Gorbunov, K. Yu</creatorcontrib><creatorcontrib>Lyubetsky, V. A.</creatorcontrib><title>An Almost Exact Linear Algorithm for Transformation of Chain-Cycle Graphs with Optimization of the Sum of Operation Costs</title><title>Doklady. Mathematics</title><addtitle>Dokl. Math</addtitle><description>For weighted directed chain-cycle graphs, an algorithm transforming one graph into another is constructed. The algorithm runs in linear time and yields a sequence of transformations with the smallest, up to an additive error, total cost. The costs of the operations of inserting and deleting an edge segment may differ from each other and from the costs of the other operations. The additive error is estimated in terms of the operation costs.</description><subject>Algorithms</subject><subject>Chains</subject><subject>Costs</subject><subject>Graphs</subject><subject>Mathematics</subject><subject>Mathematics and Statistics</subject><subject>Optimization</subject><issn>1064-5624</issn><issn>1531-8362</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><recordid>eNp1kEtLAzEUhYMoWKs_wF3A9WjemSzLUB9Q6KJ1PaQzSTulMxmTFK2_3gwjuhBX93Dvd86BC8AtRvcYU_awwkgwLggjCHFECTsDE8wpznIqyHnS6ZwN90twFcIeIcYTOQGnWQdnh9aFCOcfuopw0XRG-7TbOt_EXQut83DtdReSaHVsXAedhcVON11WnKqDgU9e97sA3xMOl31s2ubzh4s7A1fHdpDL3vhxX6S6cA0urD4Ec_M9p-D1cb4unrPF8umlmC2yiog8ZjLnlTZKy43YbIwVmipJuERY10wqyXOrZK6qvLZW1YRRVueW11QLXldCKEWn4G7M7b17O5oQy707-i5VloTJHEmk2EDhkaq8C8EbW_a-abU_lRiVw4fLPx9OHjJ6QmK7rfG_yf-bvgBIuX2A</recordid><startdate>20200901</startdate><enddate>20200901</enddate><creator>Gorbunov, K. Yu</creator><creator>Lyubetsky, V. A.</creator><general>Pleiades Publishing</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>20200901</creationdate><title>An Almost Exact Linear Algorithm for Transformation of Chain-Cycle Graphs with Optimization of the Sum of Operation Costs</title><author>Gorbunov, K. Yu ; Lyubetsky, V. A.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c268t-785cae9a7b6bbef6a39725701ad479758f9789c8dff9d2434d8f5d3a65dc66993</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>Algorithms</topic><topic>Chains</topic><topic>Costs</topic><topic>Graphs</topic><topic>Mathematics</topic><topic>Mathematics and Statistics</topic><topic>Optimization</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Gorbunov, K. Yu</creatorcontrib><creatorcontrib>Lyubetsky, V. A.</creatorcontrib><collection>CrossRef</collection><jtitle>Doklady. Mathematics</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Gorbunov, K. Yu</au><au>Lyubetsky, V. A.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>An Almost Exact Linear Algorithm for Transformation of Chain-Cycle Graphs with Optimization of the Sum of Operation Costs</atitle><jtitle>Doklady. Mathematics</jtitle><stitle>Dokl. Math</stitle><date>2020-09-01</date><risdate>2020</risdate><volume>102</volume><issue>2</issue><spage>376</spage><epage>379</epage><pages>376-379</pages><issn>1064-5624</issn><eissn>1531-8362</eissn><abstract>For weighted directed chain-cycle graphs, an algorithm transforming one graph into another is constructed. The algorithm runs in linear time and yields a sequence of transformations with the smallest, up to an additive error, total cost. The costs of the operations of inserting and deleting an edge segment may differ from each other and from the costs of the other operations. The additive error is estimated in terms of the operation costs.</abstract><cop>Moscow</cop><pub>Pleiades Publishing</pub><doi>10.1134/S1064562420050324</doi><tpages>4</tpages></addata></record>
fulltext	fulltext
identifier	ISSN: 1064-5624
ispartof	Doklady. Mathematics, 2020-09, Vol.102 (2), p.376-379
issn	1064-5624 1531-8362
language	eng
recordid	cdi_proquest_journals_2478070949
source	SpringerLink Journals - AutoHoldings
subjects	Algorithms Chains Costs Graphs Mathematics Mathematics and Statistics Optimization
title	An Almost Exact Linear Algorithm for Transformation of Chain-Cycle Graphs with Optimization of the Sum of Operation Costs
url	https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-18T09%3A48%3A26IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=An%20Almost%20Exact%20Linear%20Algorithm%20for%20Transformation%20of%20Chain-Cycle%20Graphs%20with%20Optimization%20of%20the%20Sum%20of%20Operation%20Costs&rft.jtitle=Doklady.%20Mathematics&rft.au=Gorbunov,%20K.%20Yu&rft.date=2020-09-01&rft.volume=102&rft.issue=2&rft.spage=376&rft.epage=379&rft.pages=376-379&rft.issn=1064-5624&rft.eissn=1531-8362&rft_id=info:doi/10.1134/S1064562420050324&rft_dat=%3Cproquest_cross%3E2478070949%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2478070949&rft_id=info:pmid/&rfr_iscdi=true