A linear time algorithm for constructing tree 4-spanner in 2-trees

Authors:
B. S. Panda;Anita Das
Affiliations:
Computer Science and Application Group, Department of Mathematics, Indian Institute of Technology Delhi, Hauz Khas, New Delhi, India;Computer Science and Application Group, Department of Mathematics, Indian Institute of Technology Delhi, Hauz Khas, New Delhi, India
Venue:
CIT'04 Proceedings of the 7th international conference on Intelligent Information Technology
Year:
2004

Citing 14
Cited 0

An optimal synchronizer for the hypercube

PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
A tradeoff between space and efficiency for routing tables

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
There are planar graphs almost as good as the complete graph

Journal of Computer and System Sciences
New sparseness results on graph spanners

SCG '92 Proceedings of the eighth annual symposium on Computational geometry
On sparse spanners of weighted graphs

Discrete & Computational Geometry
NP-completeness of minimum spanner problems

Discrete Applied Mathematics
Tree Spanners

SIAM Journal on Discrete Mathematics
Tree 3-spanners on interval, permutation and regular bipartite graphs

Information Processing Letters
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

SIAM Journal on Computing
Restrictions of minimum spanner problems

Information and Computation
Distance approximating trees for chordal and dually chordal graphs

Journal of Algorithms
Tree spanners in planar graphs

Discrete Applied Mathematics - Special issue on international workshop of graph-theoretic concepts in computer science WG'98 conference selected papers
A Linear Time Algorithm for Finding Tree 3-Spanner on 2-Trees

TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing
Optimal simulations of tree machines

SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

A spanning tree T of a graph G is said to be a tree t-spanner if the distance between any two vertices in T is at most t times their distance in G. A graph that has a tree t-spanner is called a tree t-spanner admissible graph. It has been shown in [3] that the problem of recognizing whether a graph admits a tree t-spanner is NP-complete for t ≥ 4. In this paper, we present a linear time algorithm for constructing a tree 4-spanner in a tree 4-spanner admissible 2-tree.