【国民娱乐每日礼金gm777.top,国民彩票手机版中大奖】我们为您提供国民彩票手机版注册,国民彩票手机版投注,国民彩票手机版app,国民彩票手机版平台,巨华彩票开户,充提快速,操控简单,为国民彩票手机版彩民服务!

行知論壇211:Trees with minimal atom-bond connectivity index - recent theoretical and computational results

時間:2019-07-08瀏覽:155設置

行知論壇211(海外學術報告)

 

報告時間:2019711日上午11:00

報告地點:計算機學院4042


報告題目:Trees with minimal atom-bond connectivity index - recent theoretical and computational results

人:Darko Dimitrov (研究員, Hochschule fuer Technik und Wirtschaft Berlin)

人:王貝貝     


報告簡介:The problem of characterizing trees with minimal atom-bond connectivity index is one of the most demanding open problems in chemical graph theory. The problem is not yet completely solved, but there was significant progress in the last several years heading towards its final solution. We will give an overview of the recent theoretical results as well as an overview of some computational approaches, which help us to better understand the structure of the trees with minimal atom-bond connectivity index.


報告人簡介:Darko Dimitrov earned his PhD in computational geometry from the Free University of Berlin, Germany as a member of the Theoretical Computer Science Group at the Department of Mathamatics and Computer Science. He has been a researcher and lecturer at the Hochschule fuer Technik und Wirtschaft Berlin, the Rheinisches Studienkolleg Berlin, the Faculty of Information Studies in Novo mesto, and University American College Skopje. His main areas of interest include graph theory and computational geometry, together with their applications in chemistry, computer graphics and computer vision.



返回原圖
/

国民彩票手机版