Ditemukan 150 dokumen yang sesuai dengan query
Gross, Daniel J. (Joseph), author
This book is concerned with the optimization problem of maximizing the number of spanning trees of a multigraph. Since a spanning tree is a minimally connected subgraph, graphs and multigraphs having more of these are, in some sense, immune to disconnection by edge failure. We employ a matrix-theoretic approach to...
New Jersey: World Scientific, 2015
511.52 GRO s
Buku Teks Universitas Indonesia Library
New York: John Wiley & Sons, 1985
511.5 GRA
Buku Teks Universitas Indonesia Library
Gordon, Charles K., author
California: Dickenson, 1967
512.817 GOR i
Buku Teks Universitas Indonesia Library
Multiple sequence alignment (MSA) is a sequence alignment of three or more biological sequences, which are assumed to have an evolutionary relationship. Because three or more sequences of biologically relevant length can be difficult and are almost always time-consuming to align by hand, computational algorithm are used to produce and...
Universitas Indonesia, 2008
S-Pdf
UI - Skripsi (Membership) Universitas Indonesia Library
Pada tulisan ini akan dibahas mengenai sebuah skema dalam kriptografi visual.
Skema kriptografi visual ini menggunakan lebih dari satu buah gambar rahasia.
Diberikan sembarang graf sederhana dan tidak berarah G=(V,E) yang berfungsi
sebagai struktur akses untuk skema kriptografi visual ini, dimana setiap simpul
dan setiap busurnya diberikan sembarang gambar. Gambar pada simpulsimpulnya
bersifat publik(umum) dan...
Universitas Indonesia, 2010
S-Pdf
UI - Skripsi (Membership) Universitas Indonesia Library
Rostika Listyaningrum, author
Misalkan 𝐺 adalah graf berarah asiklik. Matriks adjacency dari graf berarah 𝐺 dengan 𝑉 𝐺 = 𝑣1, 𝑣2, ? , 𝑣𝑛 adalah matriks 𝐴 = 𝑎𝑖𝑗 berukuran 𝑛 × 𝑛 di mana 𝑎𝑖𝑗 = 1, untuk 𝑖 ≠ 𝑗 jika terdapat busur berarah dari 𝑣𝑖 ke 𝑣𝑗 , 𝑎𝑖𝑗 =...
Depok: Universitas Indonesia, 2015
T43809
UI - Tesis (Membership) Universitas Indonesia Library
Xueliang, Li, author
Rainbow connections are natural combinatorial measures that are used in applications to secure the transfer of classified information between agencies in communication networks. Rainbow connections of graphs covers this new and emerging topic in graph theory and brings together a majority of the results that deal with the concept of...
New York: [Springer, ], 2012
e20419466
eBooks Universitas Indonesia Library
Spectral radius of graphs provides a thorough overview of important results on the spectral radius of adjacency matrix of graphs that have appeared in the literature in the preceding ten years, most of them with proofs, and including some previously unpublished results of the author. The primer begins with a...
London: Academic Press, 2015
e20427720
eBooks Universitas Indonesia Library
This book introduces new methods to analyze vertex-varying graph signals. In many real-world scenarios, the data sensing domain is not a regular grid, but a more complex network that consists of sensing points (vertices) and edges (relating the sensing points). Furthermore, sensing geometry or signal properties define the relation...
Switzerland: Springer Nature, 2019
e20509488
eBooks Universitas Indonesia Library
Maria Widiastuti, author
Salah satu masalah bioinformatika adalah masalah rekonstruksi barisan DNA dengan metode Sequencing by Hybridization (SBH). Untuk melakukan rekonstruksi barisan DNA digunakan jalur Euler yang dicari pada graf DNA. Dalam skripsi ini dibahas beberapa algoritma untuk mencari jalur Euler, berikut kompleksitas algoritmanya, dan penggunaanya dalam SBH. Secara umum algoritma yang dibahas...
Depok: Fakultas Matematika dan Ilmu Pengetahuan Alam Universitas Indonesia, 2009
S-Pdf
UI - Skripsi (Membership) Universitas Indonesia Library
