Succinct navigational oracles for families of intersection graphs on a circle (Q2079878): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3092339751 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient graph representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval graphs and related topics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4724662 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4027165 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polygon-circle and word-representable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trapezoid graphs and generalizations, geometry and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct encoding of arbitrary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct Representation of Balanced Parentheses and Static Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct representations of planar maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5091062 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact navigation and distance oracles for graphs with small treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Distance Labeling for Interval Graphs and Related Graph Families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct data structures for families of interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Localized and compact data-structure for comparability graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognition of Polygon-Circle Graphs and Graphs of Interval Filaments Is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Drawing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topics in Intersection Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875211 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient fully-compressed sequence representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Redundancy of Succinct Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognition of Circle Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for a maximum clique and a maximum independent set of a circle graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex splitting and the recognition of trapezoid graphs / rank
 
Normal rank

Latest revision as of 07:36, 30 July 2024

scientific article
Language Label Description Also known as
English
Succinct navigational oracles for families of intersection graphs on a circle
scientific article

    Statements

    Succinct navigational oracles for families of intersection graphs on a circle (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    7 October 2022
    0 references
    intersection graph
    0 references
    succinct data structure
    0 references
    navigational query
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers