Beta
ManageSearchChatDiscover
69193

Finding the (k,l)-core of a tree network with unreliable edges

Article

Last updated: 25 Dec 2024

OverviewSimilar Items

Subjects

-

Tags

-

Abstract

Given a reliable tree network  containing  vertices where each edge has an independent operational probability, this paper presents finding a reliable subtree with at most leaves and with a diameter of at most  which maximizes the expected number of nodes that are reachable from the selected subtree by operational paths. An efficient algorithm is presented for finding a reliable tree core of. Numerical example is explained to clarify the efficient algorithm.                                                                             

DOI

10.21608/mjeer.2020.69193

Authors

First Name

Abdallah W.

Last Name

Aboutahoun

MiddleName

-

Affiliation

Department of Mathematics, Faculty of Science, Alexandria University, Alexandria, Egypt.

Email

-

City

-

Orcid

-

First Name

Eman

Last Name

Fares

MiddleName

-

Affiliation

Department of Basic Sciences, Faculty of Engineering, Pharos University, Alexandria, Egypt.

Email

-

City

-

Orcid

-

Volume

29

Article Issue

1

Related Issue

9963

Issue Date

2020-01-01

Receive Date

2020-01-26

Publish Date

2020-01-01

Page Start

98

Page End

104

Print ISSN

1687-1189

Online ISSN

2682-3535

Article File

MJEER_Volume 29_Issue 1_Pages 98-104.pdf

PDF . 1.1MB

Link

https://mjeer.journals.ekb.eg/article_69193.html

Detail API

https://mjeer.journals.ekb.eg/service?article_code=69193

Order

14

Type

Original Article

Type Code

1,088

Publication Type

Journal

Publication Title

Menoufia Journal of Electronic Engineering Research

Publication Link

https://mjeer.journals.ekb.eg/

MainTitle

Finding the (k,l)-core of a tree network with unreliable edges

Details

Type

Article

Created At

22 Jan 2023