图中的顶点划分:从结构到算法(Dagstuhl Seminar 22481)

M. Chudnovsky, Neeldhara Misra, D. Paulusma, Oliver Schaudt, A. Agrawal
{"title":"图中的顶点划分:从结构到算法(Dagstuhl Seminar 22481)","authors":"M. Chudnovsky, Neeldhara Misra, D. Paulusma, Oliver Schaudt, A. Agrawal","doi":"10.4230/DagRep.12.11.109","DOIUrl":null,"url":null,"abstract":"This report documents the program and the outcomes of Dagstuhl Seminar 22481 “Vertex Partitioning in Graphs: From Structure to Algorithms”, which was held from 27 November to 2 December 2023. The report contains abstracts for presentations about recent structural and algorithmic developments for a variety of vertex partitioning problems. It also contains a collection of open problems which were posed during the seminar. Seminar","PeriodicalId":91064,"journal":{"name":"Dagstuhl reports","volume":"12 1","pages":"109-123"},"PeriodicalIF":0.0000,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Vertex Partitioning in Graphs: From Structure to Algorithms (Dagstuhl Seminar 22481)\",\"authors\":\"M. Chudnovsky, Neeldhara Misra, D. Paulusma, Oliver Schaudt, A. Agrawal\",\"doi\":\"10.4230/DagRep.12.11.109\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This report documents the program and the outcomes of Dagstuhl Seminar 22481 “Vertex Partitioning in Graphs: From Structure to Algorithms”, which was held from 27 November to 2 December 2023. The report contains abstracts for presentations about recent structural and algorithmic developments for a variety of vertex partitioning problems. It also contains a collection of open problems which were posed during the seminar. Seminar\",\"PeriodicalId\":91064,\"journal\":{\"name\":\"Dagstuhl reports\",\"volume\":\"12 1\",\"pages\":\"109-123\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Dagstuhl reports\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4230/DagRep.12.11.109\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Dagstuhl reports","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4230/DagRep.12.11.109","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

本报告记录了Dagstuhl研讨会22481“图中的顶点划分:从结构到算法”的程序和结果,该研讨会于2023年11月27日至12月2日举行。该报告包含关于各种顶点划分问题的最近结构和算法发展的摘要。它还包含了研讨会期间提出的未解决问题的集合。研讨会
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Vertex Partitioning in Graphs: From Structure to Algorithms (Dagstuhl Seminar 22481)
This report documents the program and the outcomes of Dagstuhl Seminar 22481 “Vertex Partitioning in Graphs: From Structure to Algorithms”, which was held from 27 November to 2 December 2023. The report contains abstracts for presentations about recent structural and algorithmic developments for a variety of vertex partitioning problems. It also contains a collection of open problems which were posed during the seminar. Seminar
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信