Minimal on-line labelling

DOI10.1016/J.IPL.2006.07.011MaRDI QIDQ845889zbMATH OpenOpenAlexFDO

Authors Stefan Sadnicki, Richard S. Bird

Publication date 29 January 2010

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2006.07.011

zbMATH Keywords

algorithmsanalysis of algorithmscombinatorial problems

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Analysis of algorithms (68W40)

Recommendations

• Minimum point-overlap labelling*
• Towards minimal barcodes
• Minimal coding
• Minimal accessible categories
• Tight lower bounds for the online labeling problem
• Tight lower bounds for the online labeling problem
• Minimum point-overlap labeling
• On online labeling with large label set
• Minimal concept identification and reliability
• scientific article; zbMATH DE number 7364985

Cites work

• scientific article; zbMATH DE number 1947388 (Why is no real title available?)
• scientific article; zbMATH DE number 2119641 (Why is no real title available?)
• A Tight Lower Bound for Online Monotonic List Labeling
• A new method for functional arrays
• A tight lower bound for on-line monotonic list labeling
• Adaptive functional programming
• Approximate Indexed Lists
• Fast updating of well-balanced trees
• Monads for incremental computing

Cited in

(3)

• The online house numbering problem: min-max online list labeling
• On online labeling with large label set
• Tight lower bounds for the online labeling problem

This page was built for publication: Minimal on-line labelling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845889)