Strongly Equivalent Directed Hypergraphs
Various concepts of equivalence among graphs and among hypergraphs have been studied by several authors. In this paper the concept of strong equivalence between directed hypergraphs, based on the notion of kernel, is considered and its properties are analyzed. The computational complexity of testing...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buchkapitel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 25 |
|---|---|
| container_issue | |
| container_start_page | 1 |
| container_title | |
| container_volume | 109 |
| creator | Ausiello, G. D'atri, A. Sacca', D. |
| description | Various concepts of equivalence among graphs and among hypergraphs have been studied by several authors. In this paper the concept of strong equivalence between directed hypergraphs, based on the notion of kernel, is considered and its properties are analyzed. The computational complexity of testing strong equivalence and of determining a minimal strongly equivalent hypergraph is examined and algorithms which solve such problems in polynomial time are provided. |
| doi_str_mv | 10.1016/S0304-0208(08)73100-1 |
| format | Book Chapter |
| fullrecord | <record><control><sourceid>proquest_elsev</sourceid><recordid>TN_cdi_proquest_ebookcentralchapters_403729_6_12</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0304020808731001</els_id><sourcerecordid>EBC403729_6_12</sourcerecordid><originalsourceid>FETCH-LOGICAL-e167t-c4932feb1e329918e3e39c9c3253693be11e4cb9086d77b059df99b52c0085683</originalsourceid><addsrcrecordid>eNo9kFtrwkAQhbf0QsX6Ewo-2oe0MzubvTyVYu0FhD7YPi_JZtS0YuImCv77Ri0dBobzcIZzPiFuEe4RUD_MgEAlIMGOwN4ZQoAEz8TAGQtgwRopwZ2ftFLKGu2cuRC9f9uV6CmjJaapwmsxaJpv6IZI6ZR6YjRrY7VerPbDyWZb7rIVr9vhcxk5tFwM3_Y1x0XM6mVzIy7n2arhwd_ti6-Xyef4LZl-vL6Pn6YJozZtEpQjOeccmaRzaJmYXHCBZEraUc6IrELuwOrCmBxSV8ydy1MZujapttQXcPpbx2qz5ab1nFfVT-hyxWwVllndcmy8AjLSee1RdpbHk4W7XLuSo29CyevAxbGHL6rSI_gDTn_E6Q9cfLdHnB7pF1m-YlU</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>book_chapter</recordtype><pqid>EBC403729_6_12</pqid></control><display><type>book_chapter</type><title>Strongly Equivalent Directed Hypergraphs</title><source>Elsevier ScienceDirect Journals Complete</source><source>ScienceDirect eBooks</source><creator>Ausiello, G. ; D'atri, A. ; Sacca', D.</creator><contributor>Ausiello, G ; Lucertini, M</contributor><creatorcontrib>Ausiello, G. ; D'atri, A. ; Sacca', D. ; Ausiello, G ; Lucertini, M</creatorcontrib><description>Various concepts of equivalence among graphs and among hypergraphs have been studied by several authors. In this paper the concept of strong equivalence between directed hypergraphs, based on the notion of kernel, is considered and its properties are analyzed. The computational complexity of testing strong equivalence and of determining a minimal strongly equivalent hypergraph is examined and algorithms which solve such problems in polynomial time are provided.</description><identifier>ISSN: 0304-0208</identifier><identifier>ISBN: 9780444876997</identifier><identifier>ISBN: 0444876995</identifier><identifier>EISBN: 9780080872209</identifier><identifier>EISBN: 0080872204</identifier><identifier>DOI: 10.1016/S0304-0208(08)73100-1</identifier><identifier>OCLC: 476215541</identifier><identifier>LCCallNum: QA164.A49 1985</identifier><language>eng</language><publisher>The Netherlands: Elsevier Science & Technology</publisher><subject>Algorithms ; C.2.2 [Discrete Mathematics] ; closure ; Combinatorics & graph theory ; Graph Theory-graph algorithms ; hypergraph ; kernel ; NP—complete ; Optimization ; polinomial algorithms ; Theory</subject><ispartof>Analysis and Design of Algorithms for Combinatorial Problems, 1985, Vol.109, p.1-25</ispartof><rights>1985</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Uhttps://ebookcentral.proquest.com/covers/403729-l.jpg</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/S0304-0208(08)73100-1$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>779,780,784,793,3459,3550,11288,27925,45810,45995</link.rule.ids></links><search><contributor>Ausiello, G</contributor><contributor>Lucertini, M</contributor><creatorcontrib>Ausiello, G.</creatorcontrib><creatorcontrib>D'atri, A.</creatorcontrib><creatorcontrib>Sacca', D.</creatorcontrib><title>Strongly Equivalent Directed Hypergraphs</title><title>Analysis and Design of Algorithms for Combinatorial Problems</title><description>Various concepts of equivalence among graphs and among hypergraphs have been studied by several authors. In this paper the concept of strong equivalence between directed hypergraphs, based on the notion of kernel, is considered and its properties are analyzed. The computational complexity of testing strong equivalence and of determining a minimal strongly equivalent hypergraph is examined and algorithms which solve such problems in polynomial time are provided.</description><subject>Algorithms</subject><subject>C.2.2 [Discrete Mathematics]</subject><subject>closure</subject><subject>Combinatorics & graph theory</subject><subject>Graph Theory-graph algorithms</subject><subject>hypergraph</subject><subject>kernel</subject><subject>NP—complete</subject><subject>Optimization</subject><subject>polinomial algorithms</subject><subject>Theory</subject><issn>0304-0208</issn><isbn>9780444876997</isbn><isbn>0444876995</isbn><isbn>9780080872209</isbn><isbn>0080872204</isbn><fulltext>true</fulltext><rsrctype>book_chapter</rsrctype><creationdate>1985</creationdate><recordtype>book_chapter</recordtype><recordid>eNo9kFtrwkAQhbf0QsX6Ewo-2oe0MzubvTyVYu0FhD7YPi_JZtS0YuImCv77Ri0dBobzcIZzPiFuEe4RUD_MgEAlIMGOwN4ZQoAEz8TAGQtgwRopwZ2ftFLKGu2cuRC9f9uV6CmjJaapwmsxaJpv6IZI6ZR6YjRrY7VerPbDyWZb7rIVr9vhcxk5tFwM3_Y1x0XM6mVzIy7n2arhwd_ti6-Xyef4LZl-vL6Pn6YJozZtEpQjOeccmaRzaJmYXHCBZEraUc6IrELuwOrCmBxSV8ydy1MZujapttQXcPpbx2qz5ab1nFfVT-hyxWwVllndcmy8AjLSee1RdpbHk4W7XLuSo29CyevAxbGHL6rSI_gDTn_E6Q9cfLdHnB7pF1m-YlU</recordid><startdate>1985</startdate><enddate>1985</enddate><creator>Ausiello, G.</creator><creator>D'atri, A.</creator><creator>Sacca', D.</creator><general>Elsevier Science & Technology</general><scope>FFUUA</scope></search><sort><creationdate>1985</creationdate><title>Strongly Equivalent Directed Hypergraphs</title><author>Ausiello, G. ; D'atri, A. ; Sacca', D.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-e167t-c4932feb1e329918e3e39c9c3253693be11e4cb9086d77b059df99b52c0085683</frbrgroupid><rsrctype>book_chapters</rsrctype><prefilter>book_chapters</prefilter><language>eng</language><creationdate>1985</creationdate><topic>Algorithms</topic><topic>C.2.2 [Discrete Mathematics]</topic><topic>closure</topic><topic>Combinatorics & graph theory</topic><topic>Graph Theory-graph algorithms</topic><topic>hypergraph</topic><topic>kernel</topic><topic>NP—complete</topic><topic>Optimization</topic><topic>polinomial algorithms</topic><topic>Theory</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Ausiello, G.</creatorcontrib><creatorcontrib>D'atri, A.</creatorcontrib><creatorcontrib>Sacca', D.</creatorcontrib><collection>ProQuest Ebook Central - Book Chapters - Demo use only</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Ausiello, G.</au><au>D'atri, A.</au><au>Sacca', D.</au><au>Ausiello, G</au><au>Lucertini, M</au><format>book</format><genre>bookitem</genre><ristype>CHAP</ristype><atitle>Strongly Equivalent Directed Hypergraphs</atitle><btitle>Analysis and Design of Algorithms for Combinatorial Problems</btitle><date>1985</date><risdate>1985</risdate><volume>109</volume><spage>1</spage><epage>25</epage><pages>1-25</pages><issn>0304-0208</issn><isbn>9780444876997</isbn><isbn>0444876995</isbn><eisbn>9780080872209</eisbn><eisbn>0080872204</eisbn><abstract>Various concepts of equivalence among graphs and among hypergraphs have been studied by several authors. In this paper the concept of strong equivalence between directed hypergraphs, based on the notion of kernel, is considered and its properties are analyzed. The computational complexity of testing strong equivalence and of determining a minimal strongly equivalent hypergraph is examined and algorithms which solve such problems in polynomial time are provided.</abstract><cop>The Netherlands</cop><pub>Elsevier Science & Technology</pub><doi>10.1016/S0304-0208(08)73100-1</doi><oclcid>476215541</oclcid><tpages>25</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0304-0208 |
| ispartof | Analysis and Design of Algorithms for Combinatorial Problems, 1985, Vol.109, p.1-25 |
| issn | 0304-0208 |
| language | eng |
| recordid | cdi_proquest_ebookcentralchapters_403729_6_12 |
| source | Elsevier ScienceDirect Journals Complete; ScienceDirect eBooks |
| subjects | Algorithms C.2.2 [Discrete Mathematics] closure Combinatorics & graph theory Graph Theory-graph algorithms hypergraph kernel NP—complete Optimization polinomial algorithms Theory |
| title | Strongly Equivalent Directed Hypergraphs |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-26T23%3A07%3A38IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_elsev&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=bookitem&rft.atitle=Strongly%20Equivalent%20Directed%20Hypergraphs&rft.btitle=Analysis%20and%20Design%20of%20Algorithms%20for%20Combinatorial%20Problems&rft.au=Ausiello,%20G.&rft.date=1985&rft.volume=109&rft.spage=1&rft.epage=25&rft.pages=1-25&rft.issn=0304-0208&rft.isbn=9780444876997&rft.isbn_list=0444876995&rft_id=info:doi/10.1016/S0304-0208(08)73100-1&rft_dat=%3Cproquest_elsev%3EEBC403729_6_12%3C/proquest_elsev%3E%3Curl%3E%3C/url%3E&rft.eisbn=9780080872209&rft.eisbn_list=0080872204&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=EBC403729_6_12&rft_id=info:pmid/&rft_els_id=S0304020808731001&rfr_iscdi=true |