Publication:3397683
From MaRDI portal
zbMath1192.68491MaRDI QIDQ3397683
Publication date: 22 September 2009
diameter; interval graph; interval tree; design and analysis of algorithms; all-pairs shortest paths, tree 3-spanner, \(\kappa\)-covering problem
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
Related Items
Minimum 2-tuple dominating set of an interval graph, The critical node detection problem in networks: a survey