The Set of \((N/2^i)\)-Distance Graphs of \(C_N\) and Its Application to Efficient Information Broadcast Among \(N\) Nodes Over \(K_N\)

doi 10.7287/peerj.preprints.1372v1
Full Text
Abstract

Available in full text

Date
Authors
Publisher

PeerJ

Related search

Efficient Evaluation of N-Ary Conjunctive Queries Over Trees and Graphs

2006English

On the Range of \Sum_{n=1}^\infty \Pm C_n

Annales Academiae Scientiarum Fennicae Mathematica
Mathematics
2015English

Efficient Probabilistic Information Broadcast Algorithm Over Random Geometric Topologies

2015English

Shortest Path Set Induced Vertex Ordering and Its Application to Distributed Distance Optimal Formation Path Planning and Control on Graphs

2013English

Formation of Chromium(IV,V)-Ethylenediamine-N,n,n',n'-Tetraacetate and Its Application to Spectrophotometric Determination of Cobalt(II) and Chromium(VI).

Analytical Sciences
Analytical Chemistry
1989English

An I/O-Efficient Distance Oracle for Evolving Real-World Graphs

2014English

Gold(I)-Catalyzed Intramolecular Hydroamination of N-Allylic N′-Arylureas to Form Imidazolidin-2-Ones

Advanced Synthesis and Catalysis
Organic ChemistryCatalysis
2011English

S N - 1 Invariant for Isolated N-Dimensional Singularities and Its Application to Moduli Problem

American Journal of Mathematics
Mathematics
1982English

Efficient Syntheses of [(N-C4H9)4N]4[α-Mo8O26] and [(N-C4H9)4N]2[Mo2O7]

Materials
Materials ScienceCondensed Matter Physics
2009English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy