Convex p-partitions of bipartite graphs
A set of vertices X of a graph G is convex if no shortest path between two vertices in X contains a vertex outside X. We prove that for fixed p≥1, all partitions of the vertex set of a bipartite graph into p convex sets can be found in polynomial time.
Gespeichert in:
| Veröffentlicht in: | Theoretical computer science 2016-01, Vol.609, p.511-514 |
|---|---|
| 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 | 514 |
|---|---|
| container_issue | |
| container_start_page | 511 |
| container_title | Theoretical computer science |
| container_volume | 609 |
| creator | Grippo, Luciano N. Matamala, Martín Safe, Martín D. Stein, Maya J. |
| description | A set of vertices X of a graph G is convex if no shortest path between two vertices in X contains a vertex outside X. We prove that for fixed p≥1, all partitions of the vertex set of a bipartite graph into p convex sets can be found in polynomial time. |
| doi_str_mv | 10.1016/j.tcs.2015.11.014 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1778035409</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0304397515010117</els_id><sourcerecordid>1778035409</sourcerecordid><originalsourceid>FETCH-LOGICAL-c330t-6ad59ddaec97f27e8c239176dcb3a9576b090d45bdf74d778ab6d1d12633290d3</originalsourceid><addsrcrecordid>eNp9kMFOwzAMQCMEEmPwAdx6g0tLnLRNI05oYoA0iQucozRxIVPXlKSb4O_JVM74Yln2s-VHyDXQAijUd9tiMrFgFKoCoKBQnpAFNELmjMnylCwop2XOpajOyUWMW5qiEvWC3Kz8cMDvbMxHHSY3OT_EzHdZ6-Yas4-gx894Sc463Ue8-stL8r5-fFs955vXp5fVwyY3nNMpr7WtpLUajRQdE9gYxiWI2pqWa5kutlRSW1at7URphWh0W1uwwGrOWerwJbmd947Bf-0xTmrnosG-1wP6fVSQGMqrkso0CvOoCT7GgJ0ag9vp8KOAqqMUtVVJijpKUQAqSUnM_cxg-uHgMKhoHA4GrQtoJmW9-4f-BQCjaRY</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1778035409</pqid></control><display><type>article</type><title>Convex p-partitions of bipartite graphs</title><source>Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals</source><source>Access via ScienceDirect (Elsevier)</source><creator>Grippo, Luciano N. ; Matamala, Martín ; Safe, Martín D. ; Stein, Maya J.</creator><creatorcontrib>Grippo, Luciano N. ; Matamala, Martín ; Safe, Martín D. ; Stein, Maya J.</creatorcontrib><description>A set of vertices X of a graph G is convex if no shortest path between two vertices in X contains a vertex outside X. We prove that for fixed p≥1, all partitions of the vertex set of a bipartite graph into p convex sets can be found in polynomial time.</description><identifier>ISSN: 0304-3975</identifier><identifier>EISSN: 1879-2294</identifier><identifier>DOI: 10.1016/j.tcs.2015.11.014</identifier><language>eng</language><publisher>Elsevier B.V</publisher><subject>Bipartite graph ; Computational geometry ; Convex partition ; Convexity ; Geodesic convexity ; Graph convexity ; Graph theory ; Graphs ; Partitions ; Polynomials ; Shortest-path problems</subject><ispartof>Theoretical computer science, 2016-01, Vol.609, p.511-514</ispartof><rights>2015 Elsevier B.V.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c330t-6ad59ddaec97f27e8c239176dcb3a9576b090d45bdf74d778ab6d1d12633290d3</citedby><cites>FETCH-LOGICAL-c330t-6ad59ddaec97f27e8c239176dcb3a9576b090d45bdf74d778ab6d1d12633290d3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/j.tcs.2015.11.014$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,780,784,3550,27924,27925,45995</link.rule.ids></links><search><creatorcontrib>Grippo, Luciano N.</creatorcontrib><creatorcontrib>Matamala, Martín</creatorcontrib><creatorcontrib>Safe, Martín D.</creatorcontrib><creatorcontrib>Stein, Maya J.</creatorcontrib><title>Convex p-partitions of bipartite graphs</title><title>Theoretical computer science</title><description>A set of vertices X of a graph G is convex if no shortest path between two vertices in X contains a vertex outside X. We prove that for fixed p≥1, all partitions of the vertex set of a bipartite graph into p convex sets can be found in polynomial time.</description><subject>Bipartite graph</subject><subject>Computational geometry</subject><subject>Convex partition</subject><subject>Convexity</subject><subject>Geodesic convexity</subject><subject>Graph convexity</subject><subject>Graph theory</subject><subject>Graphs</subject><subject>Partitions</subject><subject>Polynomials</subject><subject>Shortest-path problems</subject><issn>0304-3975</issn><issn>1879-2294</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2016</creationdate><recordtype>article</recordtype><recordid>eNp9kMFOwzAMQCMEEmPwAdx6g0tLnLRNI05oYoA0iQucozRxIVPXlKSb4O_JVM74Yln2s-VHyDXQAijUd9tiMrFgFKoCoKBQnpAFNELmjMnylCwop2XOpajOyUWMW5qiEvWC3Kz8cMDvbMxHHSY3OT_EzHdZ6-Yas4-gx894Sc463Ue8-stL8r5-fFs955vXp5fVwyY3nNMpr7WtpLUajRQdE9gYxiWI2pqWa5kutlRSW1at7URphWh0W1uwwGrOWerwJbmd947Bf-0xTmrnosG-1wP6fVSQGMqrkso0CvOoCT7GgJ0ag9vp8KOAqqMUtVVJijpKUQAqSUnM_cxg-uHgMKhoHA4GrQtoJmW9-4f-BQCjaRY</recordid><startdate>20160104</startdate><enddate>20160104</enddate><creator>Grippo, Luciano N.</creator><creator>Matamala, Martín</creator><creator>Safe, Martín D.</creator><creator>Stein, Maya J.</creator><general>Elsevier B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20160104</creationdate><title>Convex p-partitions of bipartite graphs</title><author>Grippo, Luciano N. ; Matamala, Martín ; Safe, Martín D. ; Stein, Maya J.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c330t-6ad59ddaec97f27e8c239176dcb3a9576b090d45bdf74d778ab6d1d12633290d3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2016</creationdate><topic>Bipartite graph</topic><topic>Computational geometry</topic><topic>Convex partition</topic><topic>Convexity</topic><topic>Geodesic convexity</topic><topic>Graph convexity</topic><topic>Graph theory</topic><topic>Graphs</topic><topic>Partitions</topic><topic>Polynomials</topic><topic>Shortest-path problems</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Grippo, Luciano N.</creatorcontrib><creatorcontrib>Matamala, Martín</creatorcontrib><creatorcontrib>Safe, Martín D.</creatorcontrib><creatorcontrib>Stein, Maya J.</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Theoretical computer science</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Grippo, Luciano N.</au><au>Matamala, Martín</au><au>Safe, Martín D.</au><au>Stein, Maya J.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Convex p-partitions of bipartite graphs</atitle><jtitle>Theoretical computer science</jtitle><date>2016-01-04</date><risdate>2016</risdate><volume>609</volume><spage>511</spage><epage>514</epage><pages>511-514</pages><issn>0304-3975</issn><eissn>1879-2294</eissn><abstract>A set of vertices X of a graph G is convex if no shortest path between two vertices in X contains a vertex outside X. We prove that for fixed p≥1, all partitions of the vertex set of a bipartite graph into p convex sets can be found in polynomial time.</abstract><pub>Elsevier B.V</pub><doi>10.1016/j.tcs.2015.11.014</doi><tpages>4</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0304-3975 |
| ispartof | Theoretical computer science, 2016-01, Vol.609, p.511-514 |
| issn | 0304-3975 1879-2294 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_1778035409 |
| source | Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals; Access via ScienceDirect (Elsevier) |
| subjects | Bipartite graph Computational geometry Convex partition Convexity Geodesic convexity Graph convexity Graph theory Graphs Partitions Polynomials Shortest-path problems |
| title | Convex p-partitions of bipartite graphs |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-29T16%3A40%3A08IST&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=Convex%20p-partitions%20of%20bipartite%20graphs&rft.jtitle=Theoretical%20computer%20science&rft.au=Grippo,%20Luciano%20N.&rft.date=2016-01-04&rft.volume=609&rft.spage=511&rft.epage=514&rft.pages=511-514&rft.issn=0304-3975&rft.eissn=1879-2294&rft_id=info:doi/10.1016/j.tcs.2015.11.014&rft_dat=%3Cproquest_cross%3E1778035409%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=1778035409&rft_id=info:pmid/&rft_els_id=S0304397515010117&rfr_iscdi=true |