scientific article; zbMATH DE number 5606397

MaRDI QIDQ3397683zbMATH OpenFDO

Authors Anita Pal, Madhumangal Pal

Publication date 22 September 2009

zbMATH Keywords

diameterinterval graphinterval treedesign and analysis of algorithmsall-pairs shortest paths, tree 3-spanner, \(\kappa\)-covering problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 2127736
• The interval B-tree
• scientific article; zbMATH DE number 804636
• Paths in \(m\)-ary interval trees
• Generalized trees and their applications
• COMPACT INTERVAL TREES: A DATA STRUCTURE FOR CONVEX HULLS
• R-trees: theory and applications
• One-sided interval trees
• scientific article; zbMATH DE number 4108819
• One-sided variations on interval trees

Cited in

(6)

• scientific article; zbMATH DE number 804636 (Why is no real title available?)
• One-sided interval trees
• Intervals of balanced binary trees in the Tamari lattice
• Tree Interpolation in Vampire
• The critical node detection problem in networks: a survey
• Minimum 2-tuple dominating set of an interval graph

This page was built for publication:

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