TRAIL EULER MINIMAL DI DALAM GRAF BERARAH YANG TERBOBOTI

Authors

  • Siti Julaeha Dosen Jurusan Matematika, Fakultas Sains dan Teknologi, UIN Sunan Gunung Djati Bandung
  • Murtiningrum Murtiningrum Mahasiswa Program Magister Matematika, Departemen Matematika FMIPA Universitas Indonesia
  • Rida Novrida Guru SMAN 11 Kota Jambi
  • Endang Retno Nugroho Dosen Universitas Nasional Jakarta

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.

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.

Downloads

Published

2015-08-01

Issue

Vol. 5 No. 1-2 (2011): ISTEK

Section

Original Research Articles