- Sparsest cut problem
#redirect
Cut (graph theory)
Wikimedia Foundation. 2010.
Sparsest cut problem
Look at other dictionaries:
Cut (graph theory) — In graph theory, a cut is a partition of the vertices of a graph into two disjoint subsets. The cut set of the cut is the set of edges whose end points are in different subsets of the partition. Edges are said to be crossing the cut if they are… … Wikipedia
Assaf Naor — (* 7. Mai 1975) ist ein tschechisch israelischer Mathematiker. Naor studierte ab 1993 an der Hebräischen Universität in Jerusalem, wo er 1998 seinen Master Abschluss machte und 2002 bei Joram Lindenstrauss promoviert wurde (Linear and non linear… … Deutsch Wikipedia
Enlightenment (The Scottish) — The Scottish Enlightenment M.A.Stewart INTRODUCTION The term ‘Scottish Enlightenment’ is used to characterize a hundred years of intellectual and cultural endeavour that started around the second decade of the eighteenth century. Our knowledge of … History of philosophy
