Improved Fixed-Parameter Algorithms for Two Feedback Set Problems
Settling a ten years open question, we show that the NP-complete Feedback Vertex Set problem is deterministically solvable in O(ck · m) time, where m denotes the number of graph edges, k denotes the size of the feedback vertex set searched for, and c is a constant. As a second result, we present a f...
Gespeichert in:
| Hauptverfasser: | , , , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 168 |
|---|---|
| container_issue | |
| container_start_page | 158 |
| container_title | |
| container_volume | |
| creator | Guo, Jiong Gramm, Jens Hüffner, Falk Niedermeier, Rolf Wernicke, Sebastian |
| description | Settling a ten years open question, we show that the NP-complete Feedback Vertex Set problem is deterministically solvable in O(ck · m) time, where m denotes the number of graph edges, k denotes the size of the feedback vertex set searched for, and c is a constant. As a second result, we present a fixed-parameter algorithm for the NP-complete Edge Bipartization problem with runtime O(2k · m2). |
| doi_str_mv | 10.1007/11534273_15 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_17116050</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>17116050</sourcerecordid><originalsourceid>FETCH-LOGICAL-p219t-1f835148ce3ca6ed36e66031ca671ef5f756e24800d8c3925b20f571825531103</originalsourceid><addsrcrecordid>eNpNkMtOwzAURM1Loi1d8QPZsGARuNeO7WRZVRSQKlGJsrac5LqEJk1kRzz-nkRlwWo0mtFodBi7RrhDAH2PKEXCtTAoT9g806mQCQjUiHjKJqgQYyGS7IxNx4CnCAjnbAICeJzpRFyyaQgfAMB1xids8dx0vv2kMlpV31TGG-ttQz35aFHvWl_1702IXOuj7VcbrYjK3Bb76JX6aOPbvKYmXLELZ-tA8z-dsbfVw3b5FK9fHp-Xi3Xcccz6GN3wFJO0IFFYRaVQpNRwfDAayUmnpSKepABlWoiMy5yDkxpTLqVABDFjN8fdzobC1s7bQ1EF0_mqsf7HjAQUyLF3e-yFITrsyJu8bffBIJgRoPkHUPwCOOhbKA</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Improved Fixed-Parameter Algorithms for Two Feedback Set Problems</title><source>Springer Books</source><creator>Guo, Jiong ; Gramm, Jens ; Hüffner, Falk ; Niedermeier, Rolf ; Wernicke, Sebastian</creator><contributor>Dehne, Frank ; Sack, Jörg-Rüdiger ; López-Ortiz, Alejandro</contributor><creatorcontrib>Guo, Jiong ; Gramm, Jens ; Hüffner, Falk ; Niedermeier, Rolf ; Wernicke, Sebastian ; Dehne, Frank ; Sack, Jörg-Rüdiger ; López-Ortiz, Alejandro</creatorcontrib><description>Settling a ten years open question, we show that the NP-complete Feedback Vertex Set problem is deterministically solvable in O(ck · m) time, where m denotes the number of graph edges, k denotes the size of the feedback vertex set searched for, and c is a constant. As a second result, we present a fixed-parameter algorithm for the NP-complete Edge Bipartization problem with runtime O(2k · m2).</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 3540281010</identifier><identifier>ISBN: 9783540281016</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 9783540317111</identifier><identifier>EISBN: 3540317112</identifier><identifier>DOI: 10.1007/11534273_15</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Algorithmics. Computability. Computer arithmetics ; Applied sciences ; Bipartite Graph ; Candidate Vertex ; Combinatorial Explosion ; Compression Step ; Computer science; control theory; systems ; Data Reduction Process ; Exact sciences and technology ; Theoretical computing</subject><ispartof>Algorithms and Data Structures, 2005, p.158-168</ispartof><rights>Springer-Verlag Berlin Heidelberg 2005</rights><rights>2005 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/11534273_15$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/11534273_15$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,779,780,784,789,790,793,4050,4051,27925,38255,41442,42511</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=17116050$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Dehne, Frank</contributor><contributor>Sack, Jörg-Rüdiger</contributor><contributor>López-Ortiz, Alejandro</contributor><creatorcontrib>Guo, Jiong</creatorcontrib><creatorcontrib>Gramm, Jens</creatorcontrib><creatorcontrib>Hüffner, Falk</creatorcontrib><creatorcontrib>Niedermeier, Rolf</creatorcontrib><creatorcontrib>Wernicke, Sebastian</creatorcontrib><title>Improved Fixed-Parameter Algorithms for Two Feedback Set Problems</title><title>Algorithms and Data Structures</title><description>Settling a ten years open question, we show that the NP-complete Feedback Vertex Set problem is deterministically solvable in O(ck · m) time, where m denotes the number of graph edges, k denotes the size of the feedback vertex set searched for, and c is a constant. As a second result, we present a fixed-parameter algorithm for the NP-complete Edge Bipartization problem with runtime O(2k · m2).</description><subject>Algorithmics. Computability. Computer arithmetics</subject><subject>Applied sciences</subject><subject>Bipartite Graph</subject><subject>Candidate Vertex</subject><subject>Combinatorial Explosion</subject><subject>Compression Step</subject><subject>Computer science; control theory; systems</subject><subject>Data Reduction Process</subject><subject>Exact sciences and technology</subject><subject>Theoretical computing</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>3540281010</isbn><isbn>9783540281016</isbn><isbn>9783540317111</isbn><isbn>3540317112</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2005</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNpNkMtOwzAURM1Loi1d8QPZsGARuNeO7WRZVRSQKlGJsrac5LqEJk1kRzz-nkRlwWo0mtFodBi7RrhDAH2PKEXCtTAoT9g806mQCQjUiHjKJqgQYyGS7IxNx4CnCAjnbAICeJzpRFyyaQgfAMB1xids8dx0vv2kMlpV31TGG-ttQz35aFHvWl_1702IXOuj7VcbrYjK3Bb76JX6aOPbvKYmXLELZ-tA8z-dsbfVw3b5FK9fHp-Xi3Xcccz6GN3wFJO0IFFYRaVQpNRwfDAayUmnpSKepABlWoiMy5yDkxpTLqVABDFjN8fdzobC1s7bQ1EF0_mqsf7HjAQUyLF3e-yFITrsyJu8bffBIJgRoPkHUPwCOOhbKA</recordid><startdate>2005</startdate><enddate>2005</enddate><creator>Guo, Jiong</creator><creator>Gramm, Jens</creator><creator>Hüffner, Falk</creator><creator>Niedermeier, Rolf</creator><creator>Wernicke, Sebastian</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>2005</creationdate><title>Improved Fixed-Parameter Algorithms for Two Feedback Set Problems</title><author>Guo, Jiong ; Gramm, Jens ; Hüffner, Falk ; Niedermeier, Rolf ; Wernicke, Sebastian</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p219t-1f835148ce3ca6ed36e66031ca671ef5f756e24800d8c3925b20f571825531103</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Algorithmics. Computability. Computer arithmetics</topic><topic>Applied sciences</topic><topic>Bipartite Graph</topic><topic>Candidate Vertex</topic><topic>Combinatorial Explosion</topic><topic>Compression Step</topic><topic>Computer science; control theory; systems</topic><topic>Data Reduction Process</topic><topic>Exact sciences and technology</topic><topic>Theoretical computing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Guo, Jiong</creatorcontrib><creatorcontrib>Gramm, Jens</creatorcontrib><creatorcontrib>Hüffner, Falk</creatorcontrib><creatorcontrib>Niedermeier, Rolf</creatorcontrib><creatorcontrib>Wernicke, Sebastian</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Guo, Jiong</au><au>Gramm, Jens</au><au>Hüffner, Falk</au><au>Niedermeier, Rolf</au><au>Wernicke, Sebastian</au><au>Dehne, Frank</au><au>Sack, Jörg-Rüdiger</au><au>López-Ortiz, Alejandro</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Improved Fixed-Parameter Algorithms for Two Feedback Set Problems</atitle><btitle>Algorithms and Data Structures</btitle><date>2005</date><risdate>2005</risdate><spage>158</spage><epage>168</epage><pages>158-168</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>3540281010</isbn><isbn>9783540281016</isbn><eisbn>9783540317111</eisbn><eisbn>3540317112</eisbn><abstract>Settling a ten years open question, we show that the NP-complete Feedback Vertex Set problem is deterministically solvable in O(ck · m) time, where m denotes the number of graph edges, k denotes the size of the feedback vertex set searched for, and c is a constant. As a second result, we present a fixed-parameter algorithm for the NP-complete Edge Bipartization problem with runtime O(2k · m2).</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/11534273_15</doi><tpages>11</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | Algorithms and Data Structures, 2005, p.158-168 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_17116050 |
| source | Springer Books |
| subjects | Algorithmics. Computability. Computer arithmetics Applied sciences Bipartite Graph Candidate Vertex Combinatorial Explosion Compression Step Computer science control theory systems Data Reduction Process Exact sciences and technology Theoretical computing |
| title | Improved Fixed-Parameter Algorithms for Two Feedback Set Problems |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-25T08%3A37%3A51IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_sprin&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Improved%20Fixed-Parameter%20Algorithms%20for%20Two%20Feedback%20Set%20Problems&rft.btitle=Algorithms%20and%20Data%20Structures&rft.au=Guo,%20Jiong&rft.date=2005&rft.spage=158&rft.epage=168&rft.pages=158-168&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=3540281010&rft.isbn_list=9783540281016&rft_id=info:doi/10.1007/11534273_15&rft_dat=%3Cpascalfrancis_sprin%3E17116050%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=9783540317111&rft.eisbn_list=3540317112&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |