Aug 11, 2009 · This paper aims at investigating the above notions from a probabilistic point of view. Informally, the goal is to investigate whether the label ...
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be ...
PDF | Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?).
Whether the label sizes can be improved if one allows for some probability of mistake when answering a query, and, if so, by how much, is investigated from ...
Aug 13, 2009 · Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?)
People also ask
What are the rules for Labelling graphs?
What are labels on a graph?
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be ...
Fingerprint. Dive into the research topics of 'On randomized representations of graphs using short labels'. Together they form a unique fingerprint.
Pierre Fraigniaud, Amos Korman: On randomized representations of graphs using short labels. SPAA 2009: 131-137. manage site settings.
On randomized representations of graphs using short labels - Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding ...
On randomized representations of graphs using short labels. Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures ...