Leanness Computation: Small Values and Special Graph Classes

Let u and v be vertices in a connected graph G = (V, E). For any integer k such that 0 ≤ k ≤ dG (u, v), the k-slice Sk (u, v) contains all vertices x on a shortest uv-path such that dG (u, x) = k. The leanness of G is the maximum diameter of a slice. This metric graph invariant has been studied unde...

Full description

Saved in:

Bibliographic Details
Published in:	Discrete Mathematics and Theoretical Computer Science Vol. 26:2; no. Graph Theory; p. 1
Main Authors:	Coudert, David, Coulomb, Samuel, Ducoffe, Guillaume
Format:	Journal Article
Language:	English
Published:	DMTCS 01.01.2024 Discrete Mathematics & Theoretical Computer Science
Subjects:	[info.info-cc]computer science [cs]/computational complexity [cs.cc] [info.info-ds]computer science [cs]/data structures and algorithms [cs.ds] Algorithms Analysis Computational Complexity Computer Science Data Structures and Algorithms geodetic graphs graph algorithms Graph theory leanness seth-based lower bounds France SETH-based lower bounds Graph algorithms Leanness Geodetic graphs
ISSN:	1365-8050, 1462-7264, 1365-8050
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!