An extremal problem on trees and database theory

MaRDI QIDQ3576707zbMATH OpenFDO

Authors Krisztián Tichler, Gyula O. H. Katona

Publication date 30 July 2010

Full work available at URL https://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAE0158/0.html

zbMATH Keywords

extremal problemsrelational databaselabelled directed treeminimum matrix representation

Mathematics Subject Classification ID

Applications of graph theory (05C90) Trees (05C05) Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Database theory (68P15)

Recommendations

• Extremal theorems for databases
• scientific article; zbMATH DE number 2080031
• Extremal problems in relational data bases
• scientific article; zbMATH DE number 4057058
• scientific article; zbMATH DE number 3984619

Cited in

(4)

• A note on trees, tables, and algorithms
• scientific article; zbMATH DE number 4057058 (Why is no real title available?)
• scientific article; zbMATH DE number 2080031 (Why is no real title available?)
• On Cartesian Trees and Range Minimum Queries

This page was built for publication: An extremal problem on trees and database theory

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