On the Confluence of Directed Graph Reductions Preserving Feedback Vertex Set Minimality
In graph theory, the minimum directed feedback vertex set (FVS) problem consists in identifying the smallest subsets of vertices in a directed graph whose deletion renders the directed graph acyclic. Although being known as NP-hard since 1972, this problem can be solved in a reasonable time on small...
Gespeichert in:
| Veröffentlicht in: | arXiv.org 2024-06 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | arXiv.org |
| container_volume | |
| creator | Moussa Abdenbi Alexandre Blondin Massé Goupil, Alain Marcotte, Odile |
| description | In graph theory, the minimum directed feedback vertex set (FVS) problem consists in identifying the smallest subsets of vertices in a directed graph whose deletion renders the directed graph acyclic. Although being known as NP-hard since 1972, this problem can be solved in a reasonable time on small instances, or on instances having special combinatorial structure. In this paper we investigate graph reductions preserving all or some minimum FVS and focus on their properties, especially the Church-Rosser property, also called confluence. The Church-Rosser property implies the irrelevance of reduction order, leading to a unique directed graph. The study seeks the largest subset of reductions with the Church-Rosser property and explores the adaptability of reductions to meet this criterion. Addressing these questions is crucial, as it may impact algorithmic implications, allowing for parallelization and speeding up sequential algorithms. |
| doi_str_mv | 10.48550/arxiv.2406.16390 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_arxiv</sourceid><recordid>TN_cdi_arxiv_primary_2406_16390</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>3072053804</sourcerecordid><originalsourceid>FETCH-LOGICAL-a524-eb0d1cbad243272b74b639fe0df28aa951df22f9c00d5fc82f713840dea3aa803</originalsourceid><addsrcrecordid>eNotj01PAjEYhBsTEwnyAzzZxPPiu_1gy9GgoAkGo8R423Tbt1LELna7BP69K3iaOUxm5iHkKoehUFLCrY57vxsyAaNhPuJjOCM9xnmeKcHYBRk0zRoA2KhgUvIe-VgEmlZIJ3VwmxaDQVo7eu8jmoSWzqLerugr2tYkX4eGvkRsMO58-KRTRFtp80XfMSbc0zdM9NkH_603Ph0uybnTmwYH_9ony-nDcvKYzRezp8ndPNOSiQwrsLmptGWCs4JVhai6zw7BOqa0Hsu8M8yNDYCVzijmipwrARY111oB75PrU-0Ru9zGbj4eyj_88ojfJW5OiW2sf1psUrmu2xi6TyWHgoHkCgT_BZwRXbc</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>3072053804</pqid></control><display><type>article</type><title>On the Confluence of Directed Graph Reductions Preserving Feedback Vertex Set Minimality</title><source>arXiv.org</source><source>Free E- Journals</source><creator>Moussa Abdenbi ; Alexandre Blondin Massé ; Goupil, Alain ; Marcotte, Odile</creator><creatorcontrib>Moussa Abdenbi ; Alexandre Blondin Massé ; Goupil, Alain ; Marcotte, Odile</creatorcontrib><description>In graph theory, the minimum directed feedback vertex set (FVS) problem consists in identifying the smallest subsets of vertices in a directed graph whose deletion renders the directed graph acyclic. Although being known as NP-hard since 1972, this problem can be solved in a reasonable time on small instances, or on instances having special combinatorial structure. In this paper we investigate graph reductions preserving all or some minimum FVS and focus on their properties, especially the Church-Rosser property, also called confluence. The Church-Rosser property implies the irrelevance of reduction order, leading to a unique directed graph. The study seeks the largest subset of reductions with the Church-Rosser property and explores the adaptability of reductions to meet this criterion. Addressing these questions is crucial, as it may impact algorithmic implications, allowing for parallelization and speeding up sequential algorithms.</description><identifier>EISSN: 2331-8422</identifier><identifier>DOI: 10.48550/arxiv.2406.16390</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Algorithms ; Apexes ; Combinatorial analysis ; Computer Science - Discrete Mathematics ; Feedback ; Graph theory ; Parallel processing ; Vertex sets</subject><ispartof>arXiv.org, 2024-06</ispartof><rights>2024. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><rights>http://creativecommons.org/licenses/by/4.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,784,885,27925</link.rule.ids><backlink>$$Uhttps://doi.org/10.48550/arXiv.2406.16390$$DView paper in arXiv$$Hfree_for_read</backlink><backlink>$$Uhttps://doi.org/10.4204/EPTCS.403.6$$DView published paper (Access to full text may be restricted)$$Hfree_for_read</backlink></links><search><creatorcontrib>Moussa Abdenbi</creatorcontrib><creatorcontrib>Alexandre Blondin Massé</creatorcontrib><creatorcontrib>Goupil, Alain</creatorcontrib><creatorcontrib>Marcotte, Odile</creatorcontrib><title>On the Confluence of Directed Graph Reductions Preserving Feedback Vertex Set Minimality</title><title>arXiv.org</title><description>In graph theory, the minimum directed feedback vertex set (FVS) problem consists in identifying the smallest subsets of vertices in a directed graph whose deletion renders the directed graph acyclic. Although being known as NP-hard since 1972, this problem can be solved in a reasonable time on small instances, or on instances having special combinatorial structure. In this paper we investigate graph reductions preserving all or some minimum FVS and focus on their properties, especially the Church-Rosser property, also called confluence. The Church-Rosser property implies the irrelevance of reduction order, leading to a unique directed graph. The study seeks the largest subset of reductions with the Church-Rosser property and explores the adaptability of reductions to meet this criterion. Addressing these questions is crucial, as it may impact algorithmic implications, allowing for parallelization and speeding up sequential algorithms.</description><subject>Algorithms</subject><subject>Apexes</subject><subject>Combinatorial analysis</subject><subject>Computer Science - Discrete Mathematics</subject><subject>Feedback</subject><subject>Graph theory</subject><subject>Parallel processing</subject><subject>Vertex sets</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GOX</sourceid><recordid>eNotj01PAjEYhBsTEwnyAzzZxPPiu_1gy9GgoAkGo8R423Tbt1LELna7BP69K3iaOUxm5iHkKoehUFLCrY57vxsyAaNhPuJjOCM9xnmeKcHYBRk0zRoA2KhgUvIe-VgEmlZIJ3VwmxaDQVo7eu8jmoSWzqLerugr2tYkX4eGvkRsMO58-KRTRFtp80XfMSbc0zdM9NkH_603Ph0uybnTmwYH_9ony-nDcvKYzRezp8ndPNOSiQwrsLmptGWCs4JVhai6zw7BOqa0Hsu8M8yNDYCVzijmipwrARY111oB75PrU-0Ru9zGbj4eyj_88ojfJW5OiW2sf1psUrmu2xi6TyWHgoHkCgT_BZwRXbc</recordid><startdate>20240624</startdate><enddate>20240624</enddate><creator>Moussa Abdenbi</creator><creator>Alexandre Blondin Massé</creator><creator>Goupil, Alain</creator><creator>Marcotte, Odile</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20240624</creationdate><title>On the Confluence of Directed Graph Reductions Preserving Feedback Vertex Set Minimality</title><author>Moussa Abdenbi ; Alexandre Blondin Massé ; Goupil, Alain ; Marcotte, Odile</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a524-eb0d1cbad243272b74b639fe0df28aa951df22f9c00d5fc82f713840dea3aa803</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Algorithms</topic><topic>Apexes</topic><topic>Combinatorial analysis</topic><topic>Computer Science - Discrete Mathematics</topic><topic>Feedback</topic><topic>Graph theory</topic><topic>Parallel processing</topic><topic>Vertex sets</topic><toplevel>online_resources</toplevel><creatorcontrib>Moussa Abdenbi</creatorcontrib><creatorcontrib>Alexandre Blondin Massé</creatorcontrib><creatorcontrib>Goupil, Alain</creatorcontrib><creatorcontrib>Marcotte, Odile</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Access via ProQuest (Open Access)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><collection>arXiv Computer Science</collection><collection>arXiv.org</collection><jtitle>arXiv.org</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Moussa Abdenbi</au><au>Alexandre Blondin Massé</au><au>Goupil, Alain</au><au>Marcotte, Odile</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>On the Confluence of Directed Graph Reductions Preserving Feedback Vertex Set Minimality</atitle><jtitle>arXiv.org</jtitle><date>2024-06-24</date><risdate>2024</risdate><eissn>2331-8422</eissn><abstract>In graph theory, the minimum directed feedback vertex set (FVS) problem consists in identifying the smallest subsets of vertices in a directed graph whose deletion renders the directed graph acyclic. Although being known as NP-hard since 1972, this problem can be solved in a reasonable time on small instances, or on instances having special combinatorial structure. In this paper we investigate graph reductions preserving all or some minimum FVS and focus on their properties, especially the Church-Rosser property, also called confluence. The Church-Rosser property implies the irrelevance of reduction order, leading to a unique directed graph. The study seeks the largest subset of reductions with the Church-Rosser property and explores the adaptability of reductions to meet this criterion. Addressing these questions is crucial, as it may impact algorithmic implications, allowing for parallelization and speeding up sequential algorithms.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><doi>10.48550/arxiv.2406.16390</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | EISSN: 2331-8422 |
| ispartof | arXiv.org, 2024-06 |
| issn | 2331-8422 |
| language | eng |
| recordid | cdi_arxiv_primary_2406_16390 |
| source | arXiv.org; Free E- Journals |
| subjects | Algorithms Apexes Combinatorial analysis Computer Science - Discrete Mathematics Feedback Graph theory Parallel processing Vertex sets |
| title | On the Confluence of Directed Graph Reductions Preserving Feedback Vertex Set Minimality |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-21T12%3A55%3A53IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_arxiv&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=On%20the%20Confluence%20of%20Directed%20Graph%20Reductions%20Preserving%20Feedback%20Vertex%20Set%20Minimality&rft.jtitle=arXiv.org&rft.au=Moussa%20Abdenbi&rft.date=2024-06-24&rft.eissn=2331-8422&rft_id=info:doi/10.48550/arxiv.2406.16390&rft_dat=%3Cproquest_arxiv%3E3072053804%3C/proquest_arxiv%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=3072053804&rft_id=info:pmid/&rfr_iscdi=true |