An experimental study of algorithms for obtaining a singly connected subgraph

An experimental study of algorithms for obtaining a singly connected subgraph

A directed graph G = (V,E) is singly connected if for any two vertices v, u of V, the directed graph G contains at most one simple path from v to u. In this paper, we study different algorithms to find a feasible but necessarily optimal solution to the following problem. Given a directed acyclic gra...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:arXiv.org 2022-11
Hauptverfasser: Zahloote, Ahmed, Al-hasan, Saleh, Ghanem, Ayman, Hasan, Hiba, Dreibaty, Asem, Abodaraa, Ali, Suleiman, Nermeen, Nour Naameh, Ibrahim, Ali, mahfoud, Zeinab
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Apexes
Graph theory
Polynomials
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 Zahloote, Ahmed
Al-hasan, Saleh
Ghanem, Ayman
Hasan, Hiba
Dreibaty, Asem
Abodaraa, Ali
Suleiman, Nermeen
Nour Naameh
Ibrahim, Ali
mahfoud, Zeinab
description A directed graph G = (V,E) is singly connected if for any two vertices v, u of V, the directed graph G contains at most one simple path from v to u. In this paper, we study different algorithms to find a feasible but necessarily optimal solution to the following problem. Given a directed acyclic graph G = (V, E), find a subset H of E of minimum size such that the subgraph (V, E-H) is singly connected. Moreover, we prove that this problem can be solved in polynomial time for a special kind of directed graphs.
format Article
fullrecord <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2721070256</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2721070256</sourcerecordid><originalsourceid>FETCH-proquest_journals_27210702563</originalsourceid><addsrcrecordid>eNqNyrEOgjAUQNHGxESi_MNLnEnKq4CrMRoXN3dSoEAJtNjXJvL3MvgBTme4d8MiFCJNzifEHYuJBs455gVmmYjY82JAfWbl9KSMlyOQD80CtgU5dtZp308ErXVgKy-10aYDCbQyLlBbY1TtVQMUqs7JuT-wbStHUvHPPTveb6_rI5mdfQdFvhxscGZNJRaY8oJjlov_ri_aID5f</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2721070256</pqid></control><display><type>article</type><title>An experimental study of algorithms for obtaining a singly connected subgraph</title><source>Free E- Journals</source><creator>Zahloote, Ahmed ; Al-hasan, Saleh ; Ghanem, Ayman ; Hasan, Hiba ; Dreibaty, Asem ; Abodaraa, Ali ; Suleiman, Nermeen ; Nour Naameh ; Ibrahim, Ali ; mahfoud, Zeinab</creator><creatorcontrib>Zahloote, Ahmed ; Al-hasan, Saleh ; Ghanem, Ayman ; Hasan, Hiba ; Dreibaty, Asem ; Abodaraa, Ali ; Suleiman, Nermeen ; Nour Naameh ; Ibrahim, Ali ; mahfoud, Zeinab</creatorcontrib><description>A directed graph G = (V,E) is singly connected if for any two vertices v, u of V, the directed graph G contains at most one simple path from v to u. In this paper, we study different algorithms to find a feasible but necessarily optimal solution to the following problem. Given a directed acyclic graph G = (V, E), find a subset H of E of minimum size such that the subgraph (V, E-H) is singly connected. Moreover, we prove that this problem can be solved in polynomial time for a special kind of directed graphs.</description><identifier>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Algorithms ; Apexes ; Graph theory ; Polynomials</subject><ispartof>arXiv.org, 2022-11</ispartof><rights>2022. This work is published under http://creativecommons.org/publicdomain/zero/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</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>780,784</link.rule.ids></links><search><creatorcontrib>Zahloote, Ahmed</creatorcontrib><creatorcontrib>Al-hasan, Saleh</creatorcontrib><creatorcontrib>Ghanem, Ayman</creatorcontrib><creatorcontrib>Hasan, Hiba</creatorcontrib><creatorcontrib>Dreibaty, Asem</creatorcontrib><creatorcontrib>Abodaraa, Ali</creatorcontrib><creatorcontrib>Suleiman, Nermeen</creatorcontrib><creatorcontrib>Nour Naameh</creatorcontrib><creatorcontrib>Ibrahim, Ali</creatorcontrib><creatorcontrib>mahfoud, Zeinab</creatorcontrib><title>An experimental study of algorithms for obtaining a singly connected subgraph</title><title>arXiv.org</title><description>A directed graph G = (V,E) is singly connected if for any two vertices v, u of V, the directed graph G contains at most one simple path from v to u. In this paper, we study different algorithms to find a feasible but necessarily optimal solution to the following problem. Given a directed acyclic graph G = (V, E), find a subset H of E of minimum size such that the subgraph (V, E-H) is singly connected. Moreover, we prove that this problem can be solved in polynomial time for a special kind of directed graphs.</description><subject>Algorithms</subject><subject>Apexes</subject><subject>Graph theory</subject><subject>Polynomials</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><recordid>eNqNyrEOgjAUQNHGxESi_MNLnEnKq4CrMRoXN3dSoEAJtNjXJvL3MvgBTme4d8MiFCJNzifEHYuJBs455gVmmYjY82JAfWbl9KSMlyOQD80CtgU5dtZp308ErXVgKy-10aYDCbQyLlBbY1TtVQMUqs7JuT-wbStHUvHPPTveb6_rI5mdfQdFvhxscGZNJRaY8oJjlov_ri_aID5f</recordid><startdate>20221127</startdate><enddate>20221127</enddate><creator>Zahloote, Ahmed</creator><creator>Al-hasan, Saleh</creator><creator>Ghanem, Ayman</creator><creator>Hasan, Hiba</creator><creator>Dreibaty, Asem</creator><creator>Abodaraa, Ali</creator><creator>Suleiman, Nermeen</creator><creator>Nour Naameh</creator><creator>Ibrahim, Ali</creator><creator>mahfoud, Zeinab</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></search><sort><creationdate>20221127</creationdate><title>An experimental study of algorithms for obtaining a singly connected subgraph</title><author>Zahloote, Ahmed ; Al-hasan, Saleh ; Ghanem, Ayman ; Hasan, Hiba ; Dreibaty, Asem ; Abodaraa, Ali ; Suleiman, Nermeen ; Nour Naameh ; Ibrahim, Ali ; mahfoud, Zeinab</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_27210702563</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Algorithms</topic><topic>Apexes</topic><topic>Graph theory</topic><topic>Polynomials</topic><toplevel>online_resources</toplevel><creatorcontrib>Zahloote, Ahmed</creatorcontrib><creatorcontrib>Al-hasan, Saleh</creatorcontrib><creatorcontrib>Ghanem, Ayman</creatorcontrib><creatorcontrib>Hasan, Hiba</creatorcontrib><creatorcontrib>Dreibaty, Asem</creatorcontrib><creatorcontrib>Abodaraa, Ali</creatorcontrib><creatorcontrib>Suleiman, Nermeen</creatorcontrib><creatorcontrib>Nour Naameh</creatorcontrib><creatorcontrib>Ibrahim, Ali</creatorcontrib><creatorcontrib>mahfoud, Zeinab</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</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>Publicly Available Content (ProQuest)</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></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Zahloote, Ahmed</au><au>Al-hasan, Saleh</au><au>Ghanem, Ayman</au><au>Hasan, Hiba</au><au>Dreibaty, Asem</au><au>Abodaraa, Ali</au><au>Suleiman, Nermeen</au><au>Nour Naameh</au><au>Ibrahim, Ali</au><au>mahfoud, Zeinab</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>An experimental study of algorithms for obtaining a singly connected subgraph</atitle><jtitle>arXiv.org</jtitle><date>2022-11-27</date><risdate>2022</risdate><eissn>2331-8422</eissn><abstract>A directed graph G = (V,E) is singly connected if for any two vertices v, u of V, the directed graph G contains at most one simple path from v to u. In this paper, we study different algorithms to find a feasible but necessarily optimal solution to the following problem. Given a directed acyclic graph G = (V, E), find a subset H of E of minimum size such that the subgraph (V, E-H) is singly connected. Moreover, we prove that this problem can be solved in polynomial time for a special kind of directed graphs.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2022-11
issn 2331-8422
language eng
recordid cdi_proquest_journals_2721070256
source Free E- Journals
subjects Algorithms
Apexes
Graph theory
Polynomials
title An experimental study of algorithms for obtaining a singly connected subgraph
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-03T14%3A19%3A15IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=An%20experimental%20study%20of%20algorithms%20for%20obtaining%20a%20singly%20connected%20subgraph&rft.jtitle=arXiv.org&rft.au=Zahloote,%20Ahmed&rft.date=2022-11-27&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E2721070256%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2721070256&rft_id=info:pmid/&rfr_iscdi=true