An algorithm for generating minimal cutsets of undirected graphs
In this paper, we propose an algorithm for generating minimal cutsets of undirected graphs. The algorithm is based on a blocking mechanism for generating every minimal cutset exactly once. The algorithm has an advantage of not requiring any preliminary steps to find minimal cutsets. The algorithm ge...
Gespeichert in:
| Veröffentlicht in: | Journal of applied mathematics & computing 1998-09, Vol.5 (3), p.681-693 |
|---|---|
| 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 | 693 |
|---|---|
| container_issue | 3 |
| container_start_page | 681 |
| container_title | Journal of applied mathematics & computing |
| container_volume | 5 |
| creator | Shin, Yong Yeon Koh, Jai Sang |
| description | In this paper, we propose an algorithm for generating minimal cutsets of undirected graphs. The algorithm is based on a blocking mechanism for generating every minimal cutset exactly once. The algorithm has an advantage of not requiring any preliminary steps to find minimal cutsets. The algorithm generates minimal cutsets atO(e · n) {wheree,n = number of (edges, vertices) in the graph} computational effort per cutset. Formal proofs of the algorithm are presented. |
| doi_str_mv | 10.1007/BF03008891 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_927599172</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2787238992</sourcerecordid><originalsourceid>FETCH-LOGICAL-c201t-b5d86b2dac41a04d5191c966d8b83a5015a388528af5ed75d531eb23ac77ab383</originalsourceid><addsrcrecordid>eNp10E1LAzEQBuAgCpbai78g6E1YnUmaTXKzllaFghc9L9kku13Zj5pkD_57t1Tw5Gnm8PAO8xJyjXCPAPLhaQscQCmNZ2SGKhcZAyXOp52xPAPI8ZIsYmxKAIYaQPAZeVz11LT1EJq072g1BFr73geTmr6mXdM3nWmpHVP0KdKhomPvmuBt8o7WwRz28YpcVKaNfvE75-Rju3lfv2S7t-fX9WqXWQaYslI4lZfMGbtEA0snUKPVee5UqbgRgMJwpQRTphLeSeEER18ybqyUpuSKz8nNKfcQhq_Rx1R8DmPop5OFZlJojZJN6PY_xKSagNL6qO5OyoYhxuCr4hCmP8N3gVAcmyz-muQ_pBRjqA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>927599172</pqid></control><display><type>article</type><title>An algorithm for generating minimal cutsets of undirected graphs</title><source>Springer Journals</source><creator>Shin, Yong Yeon ; Koh, Jai Sang</creator><creatorcontrib>Shin, Yong Yeon ; Koh, Jai Sang</creatorcontrib><description>In this paper, we propose an algorithm for generating minimal cutsets of undirected graphs. The algorithm is based on a blocking mechanism for generating every minimal cutset exactly once. The algorithm has an advantage of not requiring any preliminary steps to find minimal cutsets. The algorithm generates minimal cutsets atO(e · n) {wheree,n = number of (edges, vertices) in the graph} computational effort per cutset. Formal proofs of the algorithm are presented.</description><identifier>ISSN: 1226-0061</identifier><identifier>ISSN: 1598-5865</identifier><identifier>EISSN: 1865-2085</identifier><identifier>DOI: 10.1007/BF03008891</identifier><language>eng</language><publisher>Dordrecht: Springer Nature B.V</publisher><subject>Algorithms ; Apexes ; Applied mathematics ; Graph theory ; Graphs ; Studies</subject><ispartof>Journal of applied mathematics & computing, 1998-09, Vol.5 (3), p.681-693</ispartof><rights>Copyright Springer Nature B.V. 1998</rights><rights>Korean Society for Computational and Applied Mathematics 1998</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c201t-b5d86b2dac41a04d5191c966d8b83a5015a388528af5ed75d531eb23ac77ab383</citedby><cites>FETCH-LOGICAL-c201t-b5d86b2dac41a04d5191c966d8b83a5015a388528af5ed75d531eb23ac77ab383</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,27901,27902</link.rule.ids></links><search><creatorcontrib>Shin, Yong Yeon</creatorcontrib><creatorcontrib>Koh, Jai Sang</creatorcontrib><title>An algorithm for generating minimal cutsets of undirected graphs</title><title>Journal of applied mathematics & computing</title><description>In this paper, we propose an algorithm for generating minimal cutsets of undirected graphs. The algorithm is based on a blocking mechanism for generating every minimal cutset exactly once. The algorithm has an advantage of not requiring any preliminary steps to find minimal cutsets. The algorithm generates minimal cutsets atO(e · n) {wheree,n = number of (edges, vertices) in the graph} computational effort per cutset. Formal proofs of the algorithm are presented.</description><subject>Algorithms</subject><subject>Apexes</subject><subject>Applied mathematics</subject><subject>Graph theory</subject><subject>Graphs</subject><subject>Studies</subject><issn>1226-0061</issn><issn>1598-5865</issn><issn>1865-2085</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1998</creationdate><recordtype>article</recordtype><sourceid>8G5</sourceid><sourceid>BENPR</sourceid><sourceid>GUQSH</sourceid><sourceid>M2O</sourceid><recordid>eNp10E1LAzEQBuAgCpbai78g6E1YnUmaTXKzllaFghc9L9kku13Zj5pkD_57t1Tw5Gnm8PAO8xJyjXCPAPLhaQscQCmNZ2SGKhcZAyXOp52xPAPI8ZIsYmxKAIYaQPAZeVz11LT1EJq072g1BFr73geTmr6mXdM3nWmpHVP0KdKhomPvmuBt8o7WwRz28YpcVKaNfvE75-Rju3lfv2S7t-fX9WqXWQaYslI4lZfMGbtEA0snUKPVee5UqbgRgMJwpQRTphLeSeEER18ybqyUpuSKz8nNKfcQhq_Rx1R8DmPop5OFZlJojZJN6PY_xKSagNL6qO5OyoYhxuCr4hCmP8N3gVAcmyz-muQ_pBRjqA</recordid><startdate>19980901</startdate><enddate>19980901</enddate><creator>Shin, Yong Yeon</creator><creator>Koh, Jai Sang</creator><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7TB</scope><scope>8FD</scope><scope>FR3</scope><scope>JQ2</scope><scope>KR7</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>3V.</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>88I</scope><scope>8AL</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8FL</scope><scope>8G5</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>GUQSH</scope><scope>HCIFZ</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>L.-</scope><scope>L6V</scope><scope>M0C</scope><scope>M0N</scope><scope>M2O</scope><scope>M2P</scope><scope>M7S</scope><scope>MBDVC</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>Q9U</scope></search><sort><creationdate>19980901</creationdate><title>An algorithm for generating minimal cutsets of undirected graphs</title><author>Shin, Yong Yeon ; Koh, Jai Sang</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c201t-b5d86b2dac41a04d5191c966d8b83a5015a388528af5ed75d531eb23ac77ab383</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1998</creationdate><topic>Algorithms</topic><topic>Apexes</topic><topic>Applied mathematics</topic><topic>Graph theory</topic><topic>Graphs</topic><topic>Studies</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Shin, Yong Yeon</creatorcontrib><creatorcontrib>Koh, Jai Sang</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Civil Engineering Abstracts</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>ProQuest Central (Corporate)</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection</collection><collection>Science Database (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>Research Library (Alumni Edition)</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Database (1962 - current)</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>ProQuest Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>Research Library Prep</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ProQuest Engineering Collection</collection><collection>ABI/INFORM global</collection><collection>Computing Database</collection><collection>ProQuest Research Library</collection><collection>ProQuest Science Journals</collection><collection>Engineering Database</collection><collection>Research Library (Corporate)</collection><collection>ProQuest advanced technologies & aerospace journals</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>One Business (ProQuest)</collection><collection>ProQuest One Business (Alumni)</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>ProQuest Central Basic</collection><jtitle>Journal of applied mathematics & computing</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Shin, Yong Yeon</au><au>Koh, Jai Sang</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>An algorithm for generating minimal cutsets of undirected graphs</atitle><jtitle>Journal of applied mathematics & computing</jtitle><date>1998-09-01</date><risdate>1998</risdate><volume>5</volume><issue>3</issue><spage>681</spage><epage>693</epage><pages>681-693</pages><issn>1226-0061</issn><issn>1598-5865</issn><eissn>1865-2085</eissn><abstract>In this paper, we propose an algorithm for generating minimal cutsets of undirected graphs. The algorithm is based on a blocking mechanism for generating every minimal cutset exactly once. The algorithm has an advantage of not requiring any preliminary steps to find minimal cutsets. The algorithm generates minimal cutsets atO(e · n) {wheree,n = number of (edges, vertices) in the graph} computational effort per cutset. Formal proofs of the algorithm are presented.</abstract><cop>Dordrecht</cop><pub>Springer Nature B.V</pub><doi>10.1007/BF03008891</doi><tpages>13</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1226-0061 |
| ispartof | Journal of applied mathematics & computing, 1998-09, Vol.5 (3), p.681-693 |
| issn | 1226-0061 1598-5865 1865-2085 |
| language | eng |
| recordid | cdi_proquest_journals_927599172 |
| source | Springer Journals |
| subjects | Algorithms Apexes Applied mathematics Graph theory Graphs Studies |
| title | An algorithm for generating minimal cutsets of undirected graphs |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-11T19%3A53%3A50IST&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%20algorithm%20for%20generating%20minimal%20cutsets%20of%20undirected%20graphs&rft.jtitle=Journal%20of%20applied%20mathematics%20&%20computing&rft.au=Shin,%20Yong%20Yeon&rft.date=1998-09-01&rft.volume=5&rft.issue=3&rft.spage=681&rft.epage=693&rft.pages=681-693&rft.issn=1226-0061&rft.eissn=1865-2085&rft_id=info:doi/10.1007/BF03008891&rft_dat=%3Cproquest_cross%3E2787238992%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=927599172&rft_id=info:pmid/&rfr_iscdi=true |