scholarly journals Compact Routing Schemes for Generalised Chordal Graphs

2005 ◽  
Vol 9 (2) ◽  
pp. 277-297 ◽  
Author(s):  
Yon Dourisboure
Keyword(s):  
Chordal Graphs ◽  
Compact Routing ◽  
Routing Schemes

scholarly journals Compact Routing Schemes for Dynamic Ring Networks

2004 ◽  
Vol 37 (5) ◽  
Author(s):  
Danny Krizanc ◽  
Flaminia L. Luccio ◽  
Rajeev Raman
Keyword(s):  
Ring Networks ◽  
Compact Routing ◽  
Routing Schemes

scholarly journals Distributed computing of efficient routing schemes in generalized chordal graphs

2012 ◽  
Vol 444 ◽  
pp. 17-27 ◽  
Author(s):  
Nicolas Nisse ◽  
Ivan Rapaport ◽  
Karol Suchan
Keyword(s):  
Distributed Computing ◽  
Chordal Graphs ◽  
Routing Schemes

On the Hardness of Devising Interval Routing Schemes

1997 ◽  
Vol 07 (01) ◽  
pp. 39-47 ◽  
Author(s):  
Michele Flammini
Keyword(s):  
Time Complexity ◽  
Compact Routing ◽  
Routing Schemes ◽  
Np Completeness ◽  
Routing Scheme ◽  
Np Complete ◽  
Interval Routing ◽  
General Networks

The k-Interval Routing Scheme (k-IRS) is a compact routing scheme on general networks. It has been studied extensively and recently been implemented on the latest generation of the INMOS transputer router chips. In this paper we investigate the time complexity of devising a minimal space k-IRS and we prove that the problem of deciding whether there exists a 2-IRS for any network G is NP-complete. This is the first hardness result for k-IRS where k is constant and the graph underlying the network is unweighted. Moreover, the NP-completeness holds also for linear and strict 2-IRS.

Sign in / Sign up

Export Citation Format

Share Document