scholarly journals Scalable Algorithms for Constructing Balanced Spanning Trees on System-Ranked Process Groups

2012 ◽  
pp. 224-234 ◽  
Author(s):  
Akhil Langer ◽  
Ramprasad Venkataraman ◽  
Laxmikant Kale
Keyword(s):  
Spanning Trees ◽  
Scalable Algorithms ◽  
Process Groups

scholarly journals NP-completeness and degree restricted spanning trees

1992 ◽  
Vol 105 (1-3) ◽  
pp. 41-47 ◽  
Author(s):  
Robert James Douglas
Keyword(s):  
Spanning Trees ◽  
Np Completeness

scholarly journals The Construction of Multiple Independent Spanning Trees on Burnt Pancake Networks

IEEE Access ◽  
2021 ◽  
pp. 1-1
Author(s):  
Yi-Cheng Yang ◽  
Shih-Shun Kao ◽  
Ralf Klasing ◽  
Sun-Yuan Hsieh ◽  
Hsin-Hung Chou ◽  
...  
Keyword(s):  
Spanning Trees ◽  
Independent Spanning Trees

scholarly journals Fairest edge usage and minimum expected overlap for random spanning trees

2021 ◽  
Vol 344 (5) ◽  
pp. 112282
Author(s):  
Nathan Albin ◽  
Jason Clemens ◽  
Derek Hoare ◽  
Pietro Poggi-Corradini ◽  
Brandon Sit ◽  
...  
Keyword(s):  
Spanning Trees

A distributional semantics-based information retrieval framework for online social networks

2021 ◽  
pp. 1-11
Author(s):  
V.S. Anoop ◽  
P. Deepak ◽  
S. Asharaf
Keyword(s):  
Social Networks ◽  
Information Retrieval ◽  
Online Social Networks ◽  
Latent Dirichlet Allocation ◽  
Relevant Information ◽  
Distributional Semantics ◽  
Scalable Algorithms ◽  
Mobile Platforms ◽  
Cancer Support ◽  
Efficient Extraction

Online social networks are considered to be one of the most disruptive platforms where people communicate with each other on any topic ranging from funny cat videos to cancer support. The widespread diffusion of mobile platforms such as smart-phones causes the number of messages shared in such platforms to grow heavily, thus more intelligent and scalable algorithms are needed for efficient extraction of useful information. This paper proposes a method for retrieving relevant information from social network messages using a distributional semantics-based framework powered by topic modeling. The proposed framework combines the Latent Dirichlet Allocation and distributional representation of phrases (Phrase2Vec) for effective information retrieval from online social networks. Extensive and systematic experiments on messages collected from Twitter (tweets) show this approach outperforms some state-of-the-art approaches in terms of precision and accuracy and better information retrieval is possible using the proposed method.

scholarly journals A Time- and Message-Optimal Distributed Algorithm for Minimum Spanning Trees

2020 ◽  
Vol 16 (1) ◽  
pp. 1-27
Author(s):  
Gopal Pandurangan ◽  
Peter Robinson ◽  
Michele Scquizzato
Keyword(s):  
Distributed Algorithm ◽  
Spanning Trees ◽  
Minimum Spanning Trees

scholarly journals Properties of Commuting Graphs over Semidihedral Groups

Symmetry ◽  
2021 ◽  
Vol 13 (1) ◽  
pp. 103
Author(s):  
Tao Cheng ◽  
Matthias Dehmer ◽  
Frank Emmert-Streib ◽  
Yongtao Li ◽  
Weijun Liu
Keyword(s):  
Spanning Trees ◽  
Laplacian Spectrum ◽  
Vertex Connectivity ◽  
Laplacian Energy ◽  
Number Of Spanning Trees

This paper considers commuting graphs over the semidihedral group SD8n. We compute their eigenvalues and obtain that these commuting graphs are not hyperenergetic for odd n≥15 or even n≥2. We further compute the Laplacian spectrum, the Laplacian energy and the number of spanning trees of the commuting graphs over SD8n. We also discuss vertex connectivity, planarity, and minimum disconnecting sets of these graphs and prove that these commuting graphs are not Hamiltonian.

Sign in / Sign up

Export Citation Format

Share Document