Succinct navigational oracles for families of intersection graphs on a circle
type: Item
instance of: scholarly article
title: Succinct navigational oracles for families of intersection graphs on a circle
author: Hüseyin Acan
author: Sankardeep Chakraborty
author: Seungbum Jo
author: Kei Nakashima
author: Kunihiko Sadakane
author: Srinivasa Rao Satti
published in: Theoretical Computer Science
publication date: 2022-10-07T00:00:00Z
full work available at URL: https://arxiv.org/abs/2010.04333
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7597583
zbMATH Keywords: intersection graph
zbMATH Keywords: succinct data structure
zbMATH Keywords: navigational query
MaRDI profile type: Publication
OpenAlex ID: W3092339751
cites work: Efficient graph representations
cites work: Algorithmic graph theory and perfect graphs
cites work: Interval graphs and related topics
cites work: Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
cites work: Q4724662
cites work: Q4027165
cites work: Polygon-circle and word-representable graphs
cites work: Trapezoid graphs and generalizations, geometry and algorithms
cites work: Succinct encoding of arbitrary graphs
cites work: Succinct representation of balanced parentheses and static trees
cites work: Succinct representations of planar maps
cites work: Q5091062
cites work: Compact navigation and distance oracles for graphs with small treewidth
cites work: Optimal Distance Labeling for Interval Graphs and Related Graph Families
cites work: Succinct data structures for families of interval graphs
cites work: Localized and compact data-structure for comparability graphs
cites work: Connected permutation graphs
cites work: Recognition of Polygon-Circle Graphs and Graphs of Interval Filaments Is NP-Complete
cites work: Graph Drawing
cites work: Topics in Intersection Graph Theory
cites work: Q4875211
cites work: Efficient fully-compressed sequence representations
cites work: Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
cites work: On the Redundancy of Succinct Data Structures
cites work: Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
cites work: Recognition of Circle Graphs
cites work: Algorithms for a maximum clique and a maximum independent set of a circle graph
cites work: Vertex splitting and the recognition of trapezoid graphs
DOI: 10.1016/J.TCS.2022.06.022
description: scientific article; zbMATH DE number 7597583