Work

Computation of a Tree 3-Spanner on Trapezoid Graphs

Year: 2014

Type: preprint

Abstract: In a graph, a spanning tree is said to be a tree t-spanner of the graph if the distance between any two vertices in is at most times their distance in . The tree t-spanner has many applications in networks and distributed environments. In this paper, an algorithm is presented to find a tree -spanner on trapezoid graphs in time, where is the number of vertices of the graph.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1407.8132

Authors: Barman, Sambhu Charan, Mondal, Sukumar, Pal, Madhumangal

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W1644097047

Cites: 29

Cited by: 1

Related to: 10