Adjacency Labeling Schemes and Induced-Universal Graphs (Q4610450): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Compact Labeling Scheme for Ancestor Queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotically optimal induced universal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse universal graphs for bounded‐degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal induced universal graphs for bounded-degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Induced Universal Graphs and Adjacency Labeling for Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simpler, faster and shorter labels for distances in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearest common ancestors: a survey and a new algorithm for a distributed environment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-optimal labeling schemes for nearest common ancestors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4829034 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Graphs Which Contain All Sparse Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal Graphs for Bounded-Degree Trees and Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs which contain all small graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5688999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coding the vertexes of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: An unexpected result in coding the vertices of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced-universal graphs for graphs with bounded maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal graphs and induced-universal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs which contain all small trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3934429 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Universal Graphs for Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4177609 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Changing base without losing space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact routing schemes with low stretch factor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal codeword sets and representations of the integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On induced-universal graphs for the class of bounded-degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct encoding of arbitrary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A uniform paradigm to succinctly encode various families of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4535803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal ancestry scheme and small universal posets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact and localized distributed data structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance labeling in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implicat Representation of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4778559 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labeling Schemes for Flow and Connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labeling schemes for vertex connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimal universal graphs for hereditary classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3568753 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimal <i>n</i>-universal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585195 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct representations of permutations and functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417611 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximity-preserving labeling schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal graphs and universal functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate distance oracles / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOME UNSOLVED PROBLEMS IN GRAPH THEORY / rank
 
Normal rank

Revision as of 21:15, 17 July 2024

scientific article; zbMATH DE number 7002597
Language Label Description Also known as
English
Adjacency Labeling Schemes and Induced-Universal Graphs
scientific article; zbMATH DE number 7002597

    Statements

    Adjacency Labeling Schemes and Induced-Universal Graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    16 January 2019
    0 references
    adjacency labeling schemes
    0 references
    induced universal graphs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers