On coding labeled trees (original) (raw)

On coding labeled treesI

Rossella Petreschi

View PDFchevron_right

A unified approach to coding labeled trees

Irene Finocchi

2004

View PDFchevron_right

Engineering tree labeling schemes: A case study on least common ancestors

Irene Finocchi

2008

View PDFchevron_right

Labeling Schemes for Tree Representation

pelege pierre

Algorithmica, 2009

View PDFchevron_right

On Gracefully Labeling Trees

Dhananjay Mehendale

View PDFchevron_right

Average case analysis for tree labelling schemes

Weizhao Wang

Theoretical Computer Science, 2007

View PDFchevron_right

A Bijective Code for k-Trees with Linear Time Encoding and Decoding

Emanuele G. Fusco, Rossella Petreschi

Lecture Notes in Computer Science, 2007

View PDFchevron_right

Bijective Linear Time Coding and Decoding for k-Trees

Rossella Petreschi, Emanuele G. Fusco

Theory of Computing Systems, 2010

View PDFchevron_right

Dynamic and Multi-Functional Labeling Schemes

Noy Rotbart

Lecture Notes in Computer Science, 2014

View PDFchevron_right

Graceful Labeling for Trees

Dhananjay Mehendale

2013

View PDFchevron_right

String Coding of Trees with Locality and Heritability

Rossella Petreschi

Lecture Notes in Computer Science, 2005

View PDFchevron_right

Bottom-Up Subtree Isomorphism for Unordered Labeled Trees

Linda Pagli

Università di Pisa eBooks, 2004

View PDFchevron_right

An mboxO(n1.75)\mbox{O}(n^{1.75})mboxO(n1.75) Algorithm for L(2,1)-Labeling of Trees

Hirotaka Ono

Lecture Notes in Computer Science

View PDFchevron_right

Informative Labeling Schemes for the Least Common Ancestor Problem

Irene Finocchi

View PDFchevron_right

On the complexity of edge labelings for trees

Shmuel Zaks

Theoretical Computer Science, 1982

View PDFchevron_right

Algorithms of an optimal integer tree labeling

Valery Kirzhner

View PDFchevron_right

A logspace algorithm for tree canonization (extended abstract)

Steven Lindell

Proceedings of the twenty-fourth annual ACM symposium on Theory of computing - STOC '92, 1992

View PDFchevron_right

Graceful labeling of trees: Methods and Applications

Tasnia Faequa, Md. Momin Al Aziz

View PDFchevron_right

A Simple and Optimal Ancestry Labeling Scheme for Trees

Noy Rotbart

Lecture Notes in Computer Science, 2015

View PDFchevron_right

Improved ancestry labeling scheme for trees

Noy Rotbart

2014

View PDFchevron_right

A data structure for dynamic trees

Robert Tarjan

Journal of Computer and System Sciences, 1983

View PDFchevron_right

Non-ambiguous trees: New results and generalisation

Bérénice Oger

European Journal of Combinatorics, 2021

View PDFchevron_right

Non-ambiguous trees: new results and generalisation (Full version)

Bérénice Oger

arXiv (Cornell University), 2021

View PDFchevron_right

Vertex-magic labeling of trees and forests

J. Macdougall

Discrete Mathematics, 2003

View PDFchevron_right

Non-ambiguous trees: new results and generalization

Bérénice Oger

Discrete Mathematics & Theoretical Computer Science, 2020

View PDFchevron_right

On the subtree isomorphism problem for ordered trees

Erkki Makinen

Information Processing Letters, 1989

View PDFchevron_right

New Ideas on Labeling Schemes

Noy Rotbart

View PDFchevron_right

Logspace algorithm for tree canonization

Steven Lindell

View PDFchevron_right

On Succinct Representations of Binary Trees

Rajeev Raman

Mathematics in Computer Science, 2017

View PDFchevron_right

Dynamic Trees in Data Structure

Srinidhi Deshpande

View PDFchevron_right

Labelling and Maximum Ordering-Degrees for Trees

Daphne Liu

Discrete Applied Mathematics, 2010

View PDFchevron_right

Simply Sequentially Additive Labeling of Some Special Trees

Baskar Babujee

2012

View PDFchevron_right