A Colloquium on Graph Theory

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Colloquium on Mathemathical Music Theory

The article studies the topos Sets of actions of an 8-element monoid T on sets. It is called the triadic topos as T is isomorphic to the monoid of affine transformations of the twelve tone system Z12, leaving a given major or minor triad invariant. The subobject classifier Ω of this topos and its Lawvere-TierneyTopologies j are calculated. We explore the characteristic functions of the restrict...

متن کامل

Modern temporal network theory: A colloquium

The power of any kind of network approach lies in the ability to simplify a complex system so that one can better understand its function as a whole. Sometimes it is beneficial, however, to include more information than in a simple graph of only nodes and links. Adding information about times of interactions can make predictions and mechanistic understanding more accurate. The drawback, however...

متن کامل

Segmentation of Magnetic Resonance Brain Imaging Based on Graph Theory

Introduction: Segmentation of brain images especially from magnetic resonance imaging (MRI) is an essential requirement in medical imaging since the tissues, edges, and boundaries between them are ambiguous and difficult to detect, due to the proximity of the brightness levels of the images. Material and Methods: In this paper, the graph-base...

متن کامل

Eighth Colloquium on the Qualitative Theory of Differential Equations

A question which has been open in the theory of stochastic equations with delay for around 25 years is: what conditions on the coefficients of a linear stochastic functional differential equations characterise the mean square stability of the solution? In this talk, a simple proof is supplied for a one-dimensional linear Volterra equation. The arguments extend to equations with finite memory or...

متن کامل

Electronic Colloquium on Computational Complexity Complexity Theory and Genetics

We introduce a population genetics model in which the operators are eeectively computable { computable in polynomial time on Probabilistic Turing Machines. We shall show that in this model a population can encode easily large amount of information from enviroment into genetic code. Then it can process the information as a paralel computer. More precisely, we show that it can simulate polynomial...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Canadian Mathematical Bulletin

سال: 1960

ISSN: 0008-4395,1496-4287

DOI: 10.1017/s0008439500025418