Rank: 918 based on 76 downloads (last 30 days) and 2 files submitted
photo

Nickolas Cheilakos

E-mail
Company/University
UOA
Lat/Long
38.002197, 23.794107

Personal Profile:
Professional Interests:
Approximations and Interpolation, Linear Algebra , Graphics

 

Watch this Author's files

 

Files Posted by Nickolas View all
Updated   File Tags Downloads
(last 30 days)
Comments Rating
23 Dec 2011 Gauss elimination with complete pivoting This function calculate Gauss elimination with complete pivoting Author: Nickolas Cheilakos linear algebra, gauss, gaussian, elimination, complete elimination 51 9
  • 3.55556
3.6 | 10 ratings
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 algorithm, i want to signal a ms..., graphics, specialized, minimum spanning tree, kruskal 25 9
  • 3.16667
3.2 | 6 ratings
Comments and Ratings on Nickolas' Files View all
Updated File Comment by Comments Rating
26 Jun 2011 Kruskal Algorithm Kruskal's algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connect Author: Nickolas Cheilakos Prabandari, Rosiana

the code is very simple to understand and use.
thanks.

25 May 2010 Gauss elimination with complete pivoting This function calculate Gauss elimination with complete pivoting Author: Nickolas Cheilakos Dario

it seems, this doesn't compute P,L,U,Q such that P*A*Q = L*U
but such that A = P*L*U*Q or equivalently P'*A*Q' = L*U

23 Dec 2008 Kruskal Algorithm Kruskal's algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connect Author: Nickolas Cheilakos merabti, Billal

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

15 Oct 2008 Kruskal Algorithm Kruskal's algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connect Author: Nickolas Cheilakos mohammed reda, kheroua

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...!

15 Oct 2008 Kruskal Algorithm Kruskal's algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connect Author: Nickolas Cheilakos mohalled reda, kheroua

je voudrais savoir

Top Tags Applied by Nickolas
algorithm, complete elimination, elimination, gauss, gaussian
Files Tagged by Nickolas View all
Updated   File Tags Downloads
(last 30 days)
Comments Rating
23 Dec 2011 Gauss elimination with complete pivoting This function calculate Gauss elimination with complete pivoting Author: Nickolas Cheilakos linear algebra, gauss, gaussian, elimination, complete elimination 51 9
  • 3.55556
3.6 | 10 ratings
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 algorithm, i want to signal a ms..., graphics, specialized, minimum spanning tree, kruskal 25 9
  • 3.16667
3.2 | 6 ratings

Contact us at files@mathworks.com