Succinct navigational oracles for families of intersection graphs on a circle
dc.contributor.author | Acan, Huseyin | |
dc.contributor.author | Chakraborty, Sankardeep | |
dc.contributor.author | Jo, Seungbum | |
dc.contributor.author | Nakashima, Kei | |
dc.contributor.author | Sadakane, Kunihiko | |
dc.contributor.author | Satti, Srinivasa Rao | |
dc.date.accessioned | 2023-01-23T09:33:55Z | |
dc.date.available | 2023-01-23T09:33:55Z | |
dc.date.created | 2022-09-22T13:47:41Z | |
dc.date.issued | 2022 | |
dc.identifier.citation | Theoretical Computer Science. 2022, 928 151-166. | en_US |
dc.identifier.issn | 0304-3975 | |
dc.identifier.uri | https://hdl.handle.net/11250/3045192 | |
dc.description.abstract | We consider the problem of designing succinct navigational oracles, i.e., succinct data structures supporting basic navigational queries such as degree, adjacency and neighborhood efficiently for intersection graphs on a circle, which include graph classes such as circle graphs, k-polygon-circle graphs, circle-trapezoid graphs, trapezoid graphs. The degree query reports the number of incident edges to a given vertex, the adjacency query asks if there is an edge between two given vertices, and the neighborhood query enumerates all the neighbors of a given vertex. We first prove a general lower bound for these intersection graph classes, and then present a uniform approach that lets us obtain matching lower and upper bounds for representing each of these graph classes. More specifically, our lower bound proofs use a unified technique to produce tight bounds for all these classes, and this is followed by our data structures which are also obtained from a unified representation method to achieve succinctness for each class. In addition, we prove a lower bound of space for representing trapezoid graphs, and give a succinct navigational oracle for this class of graphs. | en_US |
dc.language.iso | eng | en_US |
dc.publisher | Elsevier | en_US |
dc.title | Succinct navigational oracles for families of intersection graphs on a circle | en_US |
dc.title.alternative | Succinct navigational oracles for families of intersection graphs on a circle | en_US |
dc.type | Peer reviewed | en_US |
dc.type | Journal article | en_US |
dc.description.version | publishedVersion | en_US |
dc.rights.holder | This version will not be available due to the publisher's copyright. | en_US |
dc.source.pagenumber | 151-166 | en_US |
dc.source.volume | 928 | en_US |
dc.source.journal | Theoretical Computer Science | en_US |
dc.identifier.doi | https://doi.org/10.1016/j.tcs.2022.06.022 | |
dc.identifier.cristin | 2054373 | |
cristin.ispublished | true | |
cristin.fulltext | original | |
cristin.qualitycode | 2 |