@inproceedings{4560d2fa03e14561876d5c61e981f43c,

title = "Fiedler¿s Clustering on m¿dimensional Lattice",

abstract = "We consider the partitioning of m-dimensional lattice graphs using Fiedler¿s approach [1], that requires the determination of the eigenvector belonging to the second smallest eigenvalue of the Laplacian. We examine the general m-dimensional lattice and, in particular, the special cases: the 1-dimensional path graph PN and the 2-dimensional lattice graph. We determine the size of the clusters and the number of links, which are cut by this partitioning as a function of Fiedler¿s threshold ¿.",

keywords = "Conf.proc. > 3 pag",

author = "S Trajanovski and {Van Mieghem}, PFA",

year = "2010",

language = "Undefined/Unknown",

publisher = "s.n.",

pages = "1--8",

editor = "s.n.",

booktitle = "Proceedings of 3rd international workshop on optimal network Topologies",

note = "null ; Conference date: 09-06-2010 Through 11-06-2010",

}