@incollection{,
	
					
					
					381503292A8ABFC3CB1BA8AB834E00DC
				,
	author={{A. SheikAbdullah} and {T.G.R AbiramieShree} and {PPriyadharshini} and {TSaranya}},
	journal={{Global Journal of Computer Science and Technology}},
	journal={{GJCST}}0975-41720975-435010.34257/gjcst,
	address={Cambridge, United States},
	publisher={Global Journals Organisation}1934352
}

@incollection{b0,
	
	
		,
	title={{Maximum Independent Set Approximation Based on Bellman-Ford Algorithm}}
	
	
		,
	journal={{Mostafa H. Dahshan}}
		
			39
			
			,
	year={2014}
			,
	publisher={Springer}
		
	
	,
	note={References Références Referencias 1}

}

@incollection{b1,
	
	
		,
	title={{Mathematical formulations and exact algorithm for the multi trip cumulative capacitated single-vehicle routing problem}}
	
	
		,
	booktitle={{Elisevier}}
				Juan Carlos Riveraa, b, * , H. Murat Afsara
		
			,
	publisher={Christian Prinsa}
			,
	year={2015}
			
		
	

}

@incollection{b2,
	
	
		,
	title={{An Ef ficient Implementation of the Bellman -Ford Algorithm for Keller GPU Architectures}}
	
	
		,
	journal={{Federico Busato and Nicola Bombieri}}
		
			27
			8
			,
	year={2016}
			,
	publisher={IEEE}
		
	
	,
	note={Member. s}

}

@book{b3,
	
	
		,
	title={{Parallel Implementation of Bellman-Ford Algorithm Using CUDA Architecture}}
		,
	author={{
			Ganesh G Surve
		} and {
			AMedha
		} and {
			Shah
		}}
		
		
		
			,
	year={2017}
			,
	publisher={IEEE}
			
		
	

}

@book{b4,
	
	
		,
	title={{Efficient Implementation of the Bellman-ford algorithm for GPU" Marjan Nazarifard}}
		
			,
	year={2017}
			,
	publisher={IEEE}
			
		
	

}

@book{b5,
	
	
		,
	title={{Demonstration of Single Link Failure Recovery using Bellman Ford and Dijil (stra Algorithm in SDN}}
		,
	editor={Syed Waleed, Muhammad Faizan, MaheenIqbal, Muhammad Irfan Anis}
		
			,
	year={2017}
			,
	publisher={IEEE}
			
		
	

}

@book{b6,
	
	
		,
	title={{A bag of paths framework for network data analysis" Kevin Francoisse}}
		,
	author={{
			IlkkaKivimaki
		} and {
			AminMantrach
		} and {
			FabriceRossi
		} and {
			MarcoSaerens
		}}
		
		
		
		
			,
	year={2017}
			,
	publisher={Elisevier}
			90
			
		
	

}

@incollection{b7,
	
	
		,
	title={{We also plan to evaluate experimental the potential distance as the distance between sequence of character by adapting it to a directed acyclic graph}}
	
	
		,
	journal={{Anggie Nastiti}}
		
			345
			
			,
	year={2018}
			,
	publisher={IEEE}
		
	
	,
	note={To be investigating the graph cut the path instead of link}

}

@incollection{b8,
	
	
		,
	title={{Hydraulically informed graph theoretic measure of link criticality for there silience analysis of water distribution networks}}
		,
	author={{
			KiskuRanjan
		} and {
			SDebanjan Chatterjee
		} and {
			MassimoTrivedy
		} and {
			Tistarelli
		}}
		
		
		
		876-895. 11
	
	
		,
	booktitle={{On the optimality of bellman ford Moore shortest path algorithm" Stasys Jukna, Georg Schnitger}}
				
			,
	publisher={Springer open}
			,
	year={2015. 2014. 2018}
			10
			
		
	
	,
	note={Face Image Abstraction by Ford-Fulkerson Algorithm and Invariant Feature Descriptor for Human Identification}

}

@incollection{b9,
	
	
		,
	title={{Chance distribution of the maximum flow of uncertain random network}}
	
	
		,
	journal={{Yuhong Sheng and Jinwu Gao}}
		
			8
			
			,
	year={2014}
			,
	publisher={Springer}
		
	

}

@incollection{b10,
	
	
		,
	title={{Minimax properties of some density measures in graphs and digraphs}}
	
	
		,
	journal={{Janet Anderson}}
		,
	editor={Hong-Jian Lai, Xiaomin Li, Xiaoxia Lin & Murong Xu}
		
			3
			
			,
	year={2018}
		
	

}

@incollection{b11,
	
	
		,
	title={{Using basis dependence distance vectors in the modified Floyd-Warshall algorithm}}
	
	
		,
	journal={{W?odzimierz Bielecki ? Krzysztof Kraska ? Tomasz Klimek}}
		
			30
			
			,
	year={2014}
			,
	publisher={Springer}
		
	

}

@incollection{b12,
	
	
		,
	title={{Probabilistic Calculation of Tolerances of the Dimension Chain Based on the Floyd-Warshall Algorithm}}
	
	
		,
	journal={{Science direct}}
		,
	editor={A. V. Muholzoeva, V. B. Masyagina, b}
		
			150
			
			,
	year={2016}
		
	

}

@book{b13,
	
	
		,
	title={{Accelerating Boyer Moore searches on binary texts}}
		,
	author={{
			TShmuel
		} and {
			MirikopelKlein
		} and {
			Ben-Nissan
		}}
		
		
		
			,
	year={2009}
			,
	publisher={Springer}
			410
			
		
	

}

@incollection{b14,
	
	
		,
	title={{A simple fast hybrid pattern-matching algorithm}}
		,
	author={{
			FrantisekFranek
		} and {
			ChristopherGJenning
		} and {
			WFSmyth
		}}
		
		
	
	
		,
	journal={{Science Direct}}
		
			5
			
			,
	year={2007}
		
	

}

@incollection{b15,
	
	
		,
	title={{A Method for Web Application Vulnerabilities Detection by Using Boyer-Moore String Matching Algorithm}}
	
	
		,
	journal={{Ain Zubaidah Mohd Saleh}}
		
			72
			
			,
	year={2015}
		
	
	,
	note={Science Direct}

}

@book{b16,
	
	
		,
	title={{Analysis and Comparison of Adaptive Huffman Coding and Arithmetic Coding algorithms}}
		,
	editor={Phyela Mbewe, Sampson D. Asare}
		
			,
	year={2017}
			,
	publisher={IEEE}
			978
			
		
	

}

@book{b17,
	
	
		,
	title={{High performance parallelization of Boyer-Moore algorithm on many-core accelerators}}
		
	

}

@book{b18,
	
	
		,
	title={{}}
		,
	author={{
			MyunghoJeong
		} and {
			Lee
		}}
		
		
			,
	year={2015}
			,
	publisher={Springer}
			18
			
		
	

}

@book{b19,
	
	
		,
	title={{Balancing decoding speed and memory usage for Huffman codes using quaternary tree}}
		,
	editor={Ahsan Habib, Mohammad Shahidur Rahman}
		
			,
	year={2017}
			,
	publisher={Springer}
			4
			
		
	

}

@incollection{b20,
	
	
		,
	title={{A variation on the Boyer-Moore algorithm}}
		,
	author={{
			ThierryLecroq
		}}
	
	
		,
	journal={{Science Direct}}
		
			92
			
			,
	year={1994}
		
	

}

@incollection{b21,
	
	
		,
	title={{A fast algorithm for Huffman decoding based on a recursion Huffman tree}}
	
	
		,
	journal={{Science Direct}}
		,
	editor={Yih-Kai Lin, Shu-Chien Huang, Cheng-Hsing Yang}
		
			85
			
			,
	year={2011}
		
	

}

@incollection{b22,
	
	
		,
	title={{A Boyer-Moore-style algorithm for regular expression pattern matching}}
		,
	author={{
			WBruce
		} and {
			Watson
		}}
		
	
	
		,
	journal={{Science Direct}}
		
			48
			
			,
	year={2002}
		
	

}

@book{b23,
	
	
		,
	title={{A Fast-Adaptive Huffman Coding Algorithm}}
		,
	author={{
			Wei-WeiLu
		} and {
			MPGough
		}}
		
		
			,
	year={1998}
			,
	publisher={IEEE}
			41
			
		
	

}

@book{b24,
	
	
		,
	title={{An algorithm For Generating n Huffman Codes with a Worst Case Of (n log, n + n log, log, n) Comparisons}}
		
			,
	year={2000}
			,
	publisher={IEEE}
			32
			
		
	

}

@book{b25,
	
	
		,
	title={{A memory Effective Adaptive Huffman Coding Algorithm}}
		
			,
	year={1993}
			,
	publisher={Springer}
			21
			
			,
	address={Steven Pigeon, Yoshua Bengio}
		
	

}

@incollection{b26,
	
	
		,
	title={{A Quick algorithm for planar fragmented objects stitching Base on KMP algorithm}}
		,
	author={{
			WangZhe
		} and {
			ChenJun
		} and {
			Yuan Gang Zhao ZhouYan
		}}
		
		
	
	
		,
	journal={{Science Direct}}
		
			467
			
			,
	year={2001}
		
	

}

@incollection{b27,
	
	
		,
	title={{Application of KMP Algorithm in Customized Flow Analysis}}
	
	
		,
	booktitle={{Qingzhu Meng, Zhenming Lei, Dazhong He}}
				
			,
	publisher={IEEE}
			,
	year={2017}
			45
			
		
	

}

@book{b28,
	
	
		,
	title={{An economical method of calculating the discrete fourier transform," in proc. AFIPS fall joint computer conf}}
		,
	author={{
			"RYavne
		}}
		
			,
	year={1968}
			,
	publisher={ACM}
			33
			
		
	

}

@book{b29,
	
	
		,
	title={{Applied Algebra, Algebraic Algorithm and Error-Correction Codes}}
		,
	author={{
			DBernstein
		}}
		
			,
	year={2007}
			
		
	
	,
	note={The tangent FFT}

}

@incollection{b30,
	
	
		,
	title={{Enhancing the security of mannets using hash algorithm}}
		,
	author={{
			DillaRavilla
		} and {
			ChandraReddy Putta
		}}
		
	
	
		,
	journal={{Computer Science}}
		
			54
			
			,
	year={2015}
		
	

}

@book{b31,
	
	
		,
	title={{Secure hash algorithm based on efficient chaotic neural network}}
		,
	author={{
			NabilAbdoun
		} and {
			EISafwan
		} and {
			Assad
		}}
		
		
		978-1-4673-8197-0/16/2016 IEEE
		
	

}

@incollection{b32,
	
	
		,
	title={{I want my IPTV}}
		,
	author={{
			RJain
		}}
	
	
		,
	journal={{IEEE Multimedia}}
		
			12
			3
			,
	year={Jul. 2005}
		
	

}

@incollection{b33,
	
	
		,
	title={{Overview of the scalable videocoding extension of the H.264/AVC standard}}
		,
	author={{
			HSchwarz
		} and {
			DMarpe
		} and {
			TWiegand
		}}
		
		
	
	
		,
	booktitle={{IEEE Transactions on Circuits and Systems for Video Technology, Special Issue on Scalable Video Coding}}
				
			,
	year={Sep. 2007}
			17
		
	

}

@incollection{b34,
	
	
		,
	title={{Network information flow}}
		,
	author={{
			RAhlswede
		} and {
			NCai
		} and {
			S.-Y.Li
		} and {
			RYeung
		}}
		
		
		
	
	
		,
	journal={{IEEE Transactions on Information Theory}}
		
			46
			4
			
			,
	year={July 2000}
		
	

}

@incollection{b35,
	
	
		,
	title={{Compact Implementation of SHA3-512 on FPGA}}
		,
	author={{
			AliaArshad
		} and {
			ArshadDur-E-Shahwarkundi
		} and {
			Aziz
		}}
		
		
	
	
		,
	booktitle={{IEEE Conf. on Information Assurance and Cyber Security (CIACS)}}
				Rewalpindi, Pakistan
		
			,
	year={June, 2014}
			
		
	

}

@incollection{b36,
	
	
		,
	title={{High throughput pipelined FPGA implementation of the new SHA-3cryptographic hash algorithm}}
		,
	author={{
			GeorgeSAthanasiou
		} and {
			George-ParisMakkas
		} and {
			Georgiostheodoridis
		}}
		
		
	
	
		,
	booktitle={{6th IEEE Int. Symp. On Communications, Control and Signal Processing}}
				Athens, Greece
		
			,
	year={May 2014}
			
		
	

}

@incollection{b37,
	
	
		,
	title={{High Performance Pipelined FPGA Implementation of the SHA-3 Hash Algorithm}}
		,
	author={{
			HarrisELenosioannou
		} and {
			ArtemiosGMichail
		} and {
			Voyiatzis
		}}
		
		
	
	
		,
	booktitle={{4th IEEE Mediterranean Conf. on Embedded Computing (MECO)}}
				Budva, Montenegro
		
			,
	year={June 2015}
			
		
	

}

@incollection{b38,
	
	
		,
	title={{Secure Hash Algorithm-3(SHA-3) implementation on Xilinx FPGAs, Suitable for IOT Applications}}
		,
	author={{
			ThomasMuzaffarrao
		} and {
			IanNewe
		} and {
			Grout
		}}
		
		
	
	
		,
	booktitle={{IEEE Int. Conf. on Computer and Information Technology, Ubiquitous Computing and Communications, Dependable, Autonomic and Secure Computing}}
				
	

}

@book{b39,
	
	
		,
	title={{Pervasive Intelligence and Computing (CIT/IUCC/ DASC/PICOM)}}
				Liverpool, England
		
			,
	year={26-28 Oct. 2015}
			
		
	

}