Fixed-Parameter Algorithms for Computing Bend-Restricted RAC Drawings of Graphs
In a right-angle crossing (RAC) drawing of a graph, each edge is represented as a polyline and edge crossings must occur at an angle of exactly $90^\circ$, where the number of bends on such polylines is typically restricted in some way. While structural and topological properties of RAC drawings hav...
Uložené v:
| Vydané v: | Journal of graph algorithms and applications Ročník 28; číslo 2; s. 131 - 150 |
|---|---|
| Hlavní autori: | , , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
06.11.2024
|
| ISSN: | 1526-1719, 1526-1719 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | In a right-angle crossing (RAC) drawing of a graph, each edge is represented as a polyline and edge crossings must occur at an angle of exactly $90^\circ$, where the number of bends on such polylines is typically restricted in some way.
While structural and topological properties of RAC drawings have been the focus of extensive research and particular attention has been paid to RAC drawings with at most $0$, $1$, $2$ and $3$ bends per edge, little was known about the boundaries of tractability for computing such drawings.
In this paper, we initiate the study of bend-restricted RAC drawings from the viewpoint of parameterized complexity. In particular, we establish that computing a RAC drawing of an input graph $G$ with at most $b$ bends where each edge $e$ has a prescribed upper-bound $0\leq \beta(e) \leq 3$ on the number of bends it can support (or determining that none exists) is:
fixed-parameter tractable parameterized by the feedback edge number of $G$, and
fixed-parameter tractable parameterized by $b$ plus the vertex cover number of $G$. |
|---|---|
| AbstractList | In a right-angle crossing (RAC) drawing of a graph, each edge is represented as a polyline and edge crossings must occur at an angle of exactly $90^\circ$, where the number of bends on such polylines is typically restricted in some way.
While structural and topological properties of RAC drawings have been the focus of extensive research and particular attention has been paid to RAC drawings with at most $0$, $1$, $2$ and $3$ bends per edge, little was known about the boundaries of tractability for computing such drawings.
In this paper, we initiate the study of bend-restricted RAC drawings from the viewpoint of parameterized complexity. In particular, we establish that computing a RAC drawing of an input graph $G$ with at most $b$ bends where each edge $e$ has a prescribed upper-bound $0\leq \beta(e) \leq 3$ on the number of bends it can support (or determining that none exists) is:
fixed-parameter tractable parameterized by the feedback edge number of $G$, and
fixed-parameter tractable parameterized by $b$ plus the vertex cover number of $G$. |
| Author | Schager, Florian Ganian, Robert Röder, Sebastian Brand, Cornelius |
| Author_xml | – sequence: 1 givenname: Cornelius surname: Brand fullname: Brand, Cornelius – sequence: 2 givenname: Robert surname: Ganian fullname: Ganian, Robert – sequence: 3 givenname: Sebastian surname: Röder fullname: Röder, Sebastian – sequence: 4 givenname: Florian surname: Schager fullname: Schager, Florian |
| BookMark | eNpN0MtOwzAUBFALFYm2sGbrH0iae13XzjIEWpAqFVWwthzHTlM1D9nh9fclwILVjDTSLM6MTNqutYTcQhIL4HxxrLSO31HWGGOa8gsyBY6rCASkk3_9isxCOCYJMhRySnbr-tOW0bP2urGD9TQ7VZ2vh0MTqOs8zbumfxvqtqJ3ti2jvQ2Dr81gS7rPcnrv9cf3Fmjn6Mbr_hCuyaXTp2Bv_nJOXtcPL_ljtN1tnvJsGxngwCO35G4lGTMSBBcSioRL1LLgzBQ6FQaXFpm0DlELYyw4JgAMlgU6nkIq2Jwsfn-N70Lw1qne1432XwoSNXqo0UP9eKjRg50BlrJWNQ |
| ContentType | Journal Article |
| DBID | AAYXX CITATION |
| DOI | 10.7155/jgaa.v28i2.2995 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | CrossRef |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics |
| EISSN | 1526-1719 |
| EndPage | 150 |
| ExternalDocumentID | 10_7155_jgaa_v28i2_2995 |
| GroupedDBID | -~9 29K 2WC 5GY AAFWJ AAKPC AAYXX ACGFO ACIPV AFPKN ALMA_UNASSIGNED_HOLDINGS CITATION D-I E3Z EBS EJD F5P GROUPED_DOAJ M~E OK1 OVT P2P REM RNS TR2 XSB |
| ID | FETCH-LOGICAL-c1515-f45f6833c8175781b0582a8b53cba97c24e238ef22a7cce1f3711c2db2f591973 |
| ISSN | 1526-1719 |
| IngestDate | Tue Nov 18 01:55:57 EST 2025 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Language | English |
| License | https://creativecommons.org/licenses/by/4.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c1515-f45f6833c8175781b0582a8b53cba97c24e238ef22a7cce1f3711c2db2f591973 |
| OpenAccessLink | https://doi.org/10.7155/jgaa.v28i2.2995 |
| PageCount | 20 |
| ParticipantIDs | crossref_primary_10_7155_jgaa_v28i2_2995 |
| PublicationCentury | 2000 |
| PublicationDate | 2024-11-06 |
| PublicationDateYYYYMMDD | 2024-11-06 |
| PublicationDate_xml | – month: 11 year: 2024 text: 2024-11-06 day: 06 |
| PublicationDecade | 2020 |
| PublicationTitle | Journal of graph algorithms and applications |
| PublicationYear | 2024 |
| SSID | ssj0023278 |
| Score | 2.337454 |
| Snippet | In a right-angle crossing (RAC) drawing of a graph, each edge is represented as a polyline and edge crossings must occur at an angle of exactly $90^\circ$,... |
| SourceID | crossref |
| SourceType | Index Database |
| StartPage | 131 |
| Title | Fixed-Parameter Algorithms for Computing Bend-Restricted RAC Drawings of Graphs |
| Volume | 28 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAON databaseName: DOAJ Directory of Open Access Journals customDbUrl: eissn: 1526-1719 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0023278 issn: 1526-1719 databaseCode: DOA dateStart: 20030101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 1526-1719 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0023278 issn: 1526-1719 databaseCode: M~E dateStart: 19970101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Nb9QwELWWwgEOFZ8CCpUPHJAql9j5sHPcVm050FKVgnqLHMdpI62yVXa77Ikf1V_YGTubjSIqlQOXKHJWo2zmaebZY78h5JOwIbJQzRIbhDBBUZzhgU6mTBLlPDYmd2qfv77JkxN1cZGejka3q7Mwi4msa7Vcptf_1dUwBs7Go7P_4O7OKAzAPTgdruB2uD7I8YfV0hbsVOOuK1RAHE8up001v_LKCzu-jQMuEOzZumBnFht3GOSdZ2MIP43-7Rp5Aoc8Qi3r2T3s1Qld7-i1bSf62quG94r1fu16f9rUdlLddE-OdF21VSi3vbur_WDxfi8p2pZgFhLtvAfiH-YKdTcc68btg-2TduVCRO4IX9IPtiJhXLYh0_5lrI3QQvWQKHrhlrcZxGdu7iVsh0lBAmXCpHCp9e5CqErsQgqO1_lvVfMfpMVusyJMk9BEhgYyZyBDA4_IYyHjFLcRHv856Cb5oXDZv_sfXk4KDXwZvEGPCfUozflzstl6k449hl6Qka1fkmfHnZDv7BX5PkATXaOJAppohyY6QBMFNNEVmui0pB5Nr8nPw4Pz_a-s7cHBDFJdVkZxmagwNIpj5wOeB7ESWuVxaHKdSiMiC6TPlkJoaYzlZSg5N6LIRRmnPJXhG7JRT2v7llCtrTIwuxCBLCIVK60CmfJcyzyNhA6Kd-Tz6ntk115qJbvn279_-E-3yNM19j6QjXlzYz-SJ2Yxr2bNtluC2XYevAMKwni3 |
| linkProvider | ISSN International Centre |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Fixed-Parameter+Algorithms+for+Computing+Bend-Restricted+RAC+Drawings+of+Graphs&rft.jtitle=Journal+of+graph+algorithms+and+applications&rft.au=Brand%2C+Cornelius&rft.au=Ganian%2C+Robert&rft.au=R%C3%B6der%2C+Sebastian&rft.au=Schager%2C+Florian&rft.date=2024-11-06&rft.issn=1526-1719&rft.eissn=1526-1719&rft.volume=28&rft.issue=2&rft.spage=131&rft.epage=150&rft_id=info:doi/10.7155%2Fjgaa.v28i2.2995&rft.externalDBID=n%2Fa&rft.externalDocID=10_7155_jgaa_v28i2_2995 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1526-1719&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1526-1719&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1526-1719&client=summon |