Self-Stablizing Pivot Interval Routing in General Networks

On the Hardness of Devising Interval Routing Schemes

Parallel Processing Letters ◽

10.1142/s0129626497000061 ◽

1997 ◽

Vol 07 (01) ◽

pp. 39-47 ◽

Cited By ~ 9

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.

Download Full-text

The performance of interval routing in general networks

10.5353/th_b3123620 ◽

1997 ◽

Author(s):

Siu-hong, Savio Tse

Keyword(s):

Interval Routing ◽

General Networks

Download Full-text

A lower bound for interval routing in general networks

Networks ◽

10.1002/(sici)1097-0037(199701)29:1<49::aid-net5>3.0.co;2-c ◽

1997 ◽

Vol 29 (1) ◽

pp. 49-53 ◽

Cited By ~ 9

Author(s):

Savio S. H. Tse ◽

Francis C. M. Lau

Keyword(s):

Lower Bound ◽

Interval Routing ◽

General Networks

Download Full-text

Interval routing schemes allow broadcasting with linear message-complexity (extended abstract)

Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing - PODC '00 ◽

10.1145/343477.343503 ◽

2000 ◽

Cited By ~ 1

Author(s):

Pierre Fraigniaud ◽

Cyril Gavoille ◽

Bernard Mans

Keyword(s):

Message Complexity ◽

Routing Schemes ◽

Interval Routing

Download Full-text

Is the Letter ‘t’ in the Word ‘gourmet’? Disruption in Task-Evoked Connectivity Networks in Adults with Impaired Literacy Skills

NeuroSci ◽

10.3390/neurosci2010005 ◽

2021 ◽

Vol 2 (1) ◽

pp. 75-94

Author(s):

Kulpreet Cheema ◽

William E. Hodgetts ◽

Jacqueline Cummine

Keyword(s):

Developmental Disorders ◽

Brain Networks ◽

Literacy Skills ◽

Resting State Networks ◽

Skilled Readers ◽

University Of Alberta ◽

Domain Specific ◽

Probe Task ◽

The University ◽

General Networks

Much work has been done to characterize domain-specific brain networks associated with reading, but very little work has been done with respect to spelling. Our aim was to characterize domain-specific spelling networks (SpNs) and domain-general resting state networks (RSNs) in adults with and without literacy impairments. Skilled and impaired adults were recruited from the University of Alberta. Participants completed three conditions of an in-scanner spelling task called a letter probe task (LPT). We found highly connected SpNs for both groups of individuals, albeit comparatively more connections for skilled (50) vs. impaired (43) readers. Notably, the SpNs did not correlate with spelling behaviour for either group. We also found relationships between SpNs and RSNs for both groups of individuals, this time with comparatively fewer connections for skilled (36) vs. impaired (53) readers. Finally, the RSNs did predict spelling performance in a limited manner for the skilled readers. These results advance our understanding of brain networks associated with spelling and add to the growing body of literature that describes the important and intricate connections between domain-specific networks and domain-general networks (i.e., resting states) in individuals with and without developmental disorders.

Download Full-text

Experimental observation of quantum nonlocality in general networks with different topologies

Fundamental Research ◽

10.1016/j.fmre.2020.11.002 ◽

2021 ◽

Vol 1 (1) ◽

pp. 22-26

Author(s):

Chao Zhang ◽

Huan Cao ◽

Yun-Feng Huang ◽

Bi-Heng Liu ◽

Chuan-Feng Li ◽

...

Keyword(s):

Experimental Observation ◽

Quantum Nonlocality ◽

General Networks

Download Full-text

Impact of Hidden Networks in Business Systems

Materials Science Forum ◽

10.4028/www.scientific.net/msf.957.247 ◽

2019 ◽

Vol 957 ◽

pp. 247-254

Author(s):

Markus Moritz ◽

Daniel Fuchs ◽

Marian Gheorghe

Keyword(s):

Business Systems ◽

Time To Market ◽

Substantial Impact ◽

Market Strategy ◽

Open Networks ◽

New Models ◽

Operational Activities ◽

Reducing Costs ◽

Positive Effect ◽

General Networks

In general, networks in companies or between companies play a significant role for monetary as well as non-monetary enhancement through cooperation. The aim is a positive effect for reducing innovation cycles, reducing costs and establishing a well-balanced time to market strategy. Besides open networks, where every actor is known, the existence of hidden networks, internal as well as external, have a substantial impact on strategic and operational activities meaning either a contribution or threat for the actors outside the hidden network. With the new models introduced in this publication, actors in various environments are able to identify hidden networks in order to be able to push contributions or eliminate risks leading from profit cuts to illegal knowledge transfer.

Download Full-text