Rank: 30429 based on downloads (last 30 days) and 0 files submitted

Ayman Ahmed

E-mail: ayman2_77@yahoo.com
Company/University: Alazhar

Personal Profile:
Professional Interests:

Files
Watch Lists

Top Tags Applied by Ayman	1 - 5 of 5
algorithm, maxflow mincut, maximum flow, minimum cut, segment objects

Files Tagged by Ayman				View all 1 - 3 of 3
Updated	File	Tags	Downloads (last 30 days)	Comments	Rating
03 Apr 2008	Ford-Fulkerson algorithm The Ford-Fulkerson algorithm (named for L. R. Ford, Jr. and D. R. Fulkerson) computes the maximum fl Author: Bing He	maxflow mincut, minimum cut, maximum flow, wireless	52	5
30 Sep 2005	Prims Algorithm Minimal spanning tree. Author: Vikramaditya Kundur	algorithm, plotting, graphics, specialized plot, spanning, specialized	61	4	4.0 4.0 \| 8 ratings
01 Nov 2002	Lidar Imaging Case Study(with Geometric Distortion Correction) Case study used in Advanced Image Processing seminars (highlights algorithm development) Author: Robert Bemis	segment objects, application, remove distortion bac..., measure features	42	2	3.33333 3.3 \| 3 ratings

Currently Watching
Type	Description
File	Kruskal Algorithm

Files Matching Ayman's Watch List					1 - 1 of 1
Updated		File	Tags	Downloads (last 30 days)	Comments	Rating
20 Dec 2006		Kruskal Algorithm Kruskal's algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connect Author: Nickolas Cheilakos	graphics, i want to signal a ms..., kruskal, specialized plot, algorithm, plotting	73	8	3.16667 3.2 \| 6 ratings

Comments and Ratings Matching Ayman's Watch List			1-5 of 11
Date	File	Comment by	Comments	Rating
23 Dec 2008	Kruskal Algorithm Kruskal's algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connect	Billal merabti	the code of 'connected' function is not correct. if you want to use this code you have to correct it (it is simple to do). but i think that the code is verry simple to understand and to use. an other think, we can use the matlab function max(PV,3)' in the place of "fysalida.m" thanks	Comment only
15 Oct 2008	Kruskal Algorithm Kruskal's algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connect	kheroua mohammed reda	a kadri mourad...es-tu celui que je connais le prof. de geologie a l'ecole des mines de paris...si oui j'aimerais renrer en contact...!	Comment only
15 Oct 2008	Kruskal Algorithm Kruskal's algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connect	kheroua mohalled reda	je voudrais savoir	Comment only
31 May 2008	Kruskal Algorithm Kruskal's algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connect	Lai Wei	I think the code is not correct. If we get w=[0 1 0 0;1 0 1 0;0 1 0 0;0 1 0 0], the connected will also be 1.	Comment only
11 May 2008	Kruskal Algorithm Kruskal's algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connect	kadri mourad		3

MATLAB Central Terms of Use

NOTICE: Any content you submit to MATLAB Central, including personal information, is not subject to the protections which may be afforded information collected under other sections of The MathWorks, Inc. Web site. You are entirely responsible for all content that you upload, post, e-mail, transmit or otherwise make available via MATLAB Central. The MathWorks does not control the content posted by visitors to MATLAB Central and, does not guarantee the accuracy, integrity, or quality of such content. Under no circumstances will The MathWorks be liable in any way for any content not authored by The MathWorks, or any loss or damage of any kind incurred as a result of the use of any content posted, e-mailed, transmitted or otherwise made available via MATLAB Central. Read the complete Terms prior to use.