Výsledky vyhledávání - "Sugeng, Kiki A."

Akademický článek

Distance-Local Rainbow Connection Number

Publikováno v: Discussiones Mathematicae Graph Theory, Vol 42, Iss 4, Pp 1027-1039 (2022)

Under an edge coloring (not necessarily proper), a rainbow path is a path whose edge colors are all distinct. The d-local rainbow connection number lrcd(G) (respectively, d-local strong rainbow connection number lsrcd(G)) is the smallest number of co

Externí odkaz: https://doaj.org/article/6b74c7d662474068a4da86a6116113ce

Zobrazit plný text záznamu

Akademický článek

Two types irregular labelling on dodecahedral modified generalization graph

Autor: Hinding, Nurdin ^{a, ⁎}, Sugeng, Kiki A. ^b, Nurlindah ^c, Wahyudi, Timothy J. ^d, Simanjuntak, Rinovia ^e

Publikováno v: In Heliyon November 2022 8(11)

Zobrazit plný text záznamu

Akademický článek

Improving data security with the utilization of matrix columnar transposition techniques

Autor: Tulus, Sy Syafrizal, Sugeng Kiki A., Simanjuntak Rinovia, Marpaung J.L.

Publikováno v: E3S Web of Conferences, Vol 501, p 02004 (2024)

The Graph Neural Network (GNN) is an advanced use of graph theory that is used to address complex network problems. The application of Graph Neural Networks allows the development of a network by the modification of weights associated with the vertic

Externí odkaz: https://doaj.org/article/b34a90b2eb224ed38374841356c75375

Zobrazit plný text záznamu

Akademický článek

Polynomial equation in algebraic attack on NTRU-HPS and NTRU-HRSS

Autor: Paradise Fadila, Sugeng Kiki Ariyanti

Publikováno v: ITM Web of Conferences, Vol 61, p 01002 (2024)

NTRU is a lattice-based public-key cryptosystem designed by Jeffrey Hoffstein, Jill Pipher, and Joseph H. Silverman in 1996. NTRU published on Algorithmic Number Theory Symposium (ANTS) in 1998. The ANTS’98 NTRU became the IEEE standard for public

Externí odkaz: https://doaj.org/article/9ec6e533885f4cfebd3f6d4f485afeda

Zobrazit plný text záznamu

Akademický článek

Modular irregularity strength of disjoint union of cycle-related graph

Autor: Barack Zeveliano Zidane, Sugeng Kiki Ariyanti

Publikováno v: ITM Web of Conferences, Vol 61, p 01001 (2024)

Let G = (V,E) be a graph with a vertex set V and an edge set E of G, with order n. Modular irregular labeling of a graph G is an edge k-labeling φ:E → {1, 2,…,k} such that the modular weight of all vertices is all different. The modular weight i

Externí odkaz: https://doaj.org/article/c26b041c94d24026b7d486f918b9d9bb

Zobrazit plný text záznamu