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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Networks Ročník 32; číslo 2; s. 103 - 113
Hlavní autoři:	Narayanan, Lata, Shende, Sunil
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Wiley Subscription Services, Inc., A Wiley Company 01.09.1998 John Wiley & Sons
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!