TRAIL EULER MINIMAL DI DALAM GRAF BERARAH YANG TERBOBOTI

Siti Julaeha, Murtiningrum Murtiningrum, Rida Novrida, Endang Retno Nugroho

Abstract


Suppose G is a Eulerian directed graph with an edge labeling. In this paper will discuss the literature studies an algorithm to construct Euler trail that starts at a node r with the lexicographic minimum label among all Euler trail that starts node r is.

Full Text:

PDF

References


Bang-Jensen, J. and Gutin, G. Digraphs Theory, Algorithms an Application. Springer-Verlag, Berlin Heidelberg, New York, London, Paris, Tokyo, Hongkong, Barcelona, Budhapest, 15th August 2007.

Bo Huai Victor, L. Eulerian Path and Circuit. January 24, 2010.

Liu, C.L. Dasar-Dasar Matematika Diskrit, Alih Bahasa Ir. Bambang Sumantri, PT Gramedia Pustaka Utama, Jakarta 1995.

Matamala, M. and Moreno, E. (2004). Minimal Eulerian trail in a labeled digraph. Departemen Matematika UCHILE-CNRS, Casilla 170-3, Correo 3, Santiago, Chile.

Priyanto, H (2010). Konstruksi Barisan de Bruijn. Departemen Matematika Universitas Indonesia, Indonesia.

West, D. B (2001). Introduction to Graph Theory, Second Edition. University of Illinois-Urbana: Prentice Hall.


slot https://bursaikan.kkp.go.id/obc/ https://riph.pertanian.go.id/liquid/ slot gacor https://riph.pertanian.go.id/bl/ judi bola https://sievo.kemdikbud.go.id/infy/ situs toto https://sievo.kemdikbud.go.id/jb/ https://www.assets.rpg.co.id/ https://www.linkandthink.org/ https://sievo.kemdikbud.go.id/relx/ Slot Gacor https://www.theyashotel.com/ https://elearning.itbwigalumajang.ac.id/ https://e-absensi.singkawangkota.go.id/ https://bapeten.go.id/upload/ https://sentraki.itbwigalumajang.ac.id/ https://lppm.itbwigalumajang.ac.id/ https://bkombandung.kemkes.go.id/ slot gacor hari ini https://sinovik.kemkes.go.id/assets/run/ https://pdcproductions.com/ https://kkp.umt.ac.id/ https://csirt.sulbarprov.go.id/uploads/ https://sievo.kemdikbud.go.id/ https://sievo.kemdikbud.go.id/thai/