法国科学社会数学与分析中心 Patrice Ossona De Mendez研究员 学术报告

时间:2021-11-30浏览:10设置

报告题目:Gentle graphs (II)

报 告 人:Patrice Ossona De Mende法国科学社会数学与分析中心 研究员

报告时间:202112316:30-17:30

报告地点:Zoom,会议ID: 861 3902 5318,密码: 387940

摘要:Not all graphs have the same complexity. Depending on the problem, one may prefer sufciently random graphs or highly structured graphs, dense graphs or sparse graphs. Several complexity measures are known for sparse graphs, degeneracy being a prime example. In this talk, I will present some works aiming to define an analogue to degeneracy for dense graphs.

 

邀请人:朱绪鼎


浙江师范大学离散数学研究中心版权所有 © 2018-2028
地址:浙江省金华市迎宾大道688号21幢 邮政编码:321004
联系电话:0579-82282629   电子邮箱:jcsx@zjnu.cn    管理登陆