Partial characterizations of networks supporting shortest path interval labeling schemes

In this paper, we consider the problem of shortest path interval routing, a space‐efficient strategy for routing in distributed networks. In this scheme, an ordering of the vertices is chosen so that the edges of the network can be labeled with one or more subintervals of the vertex ordering: The re...

Full description

Saved in:

Bibliographic Details
Published in:	Networks Vol. 32; no. 2; pp. 103 - 113
Main Authors:	Narayanan, Lata, Shende, Sunil
Format:	Journal Article
Language:	English
Published:	New York Wiley Subscription Services, Inc., A Wiley Company 01.09.1998 John Wiley & Sons
Subjects:	Applied sciences Computer science; control theory; systems Exact sciences and technology graph theory Information retrieval. Graph interval routing algorithms Switching and signalling Systems, networks and services of telecommunications Telecommunications Telecommunications and information theory Theoretical computing theory of parallel and distributed computation Interval graph Optimal strategy Network Shortest path Routing Parallel computation Graph theory Distributed computing
ISSN:	0028-3045, 1097-0037
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!