首页> 外文会议>Annual ACM-SIAM symposium on Discrete algorithms;ACM-SIAM symposium on Discrete algorithms >Perfect matchings in random graphs with prescribed minimal degree
【24h】

Perfect matchings in random graphs with prescribed minimal degree

机译:具有指定最小度的随机图中的完美匹配

获取原文

摘要

The papers in this volume were presented at the Fourteenth Annual ACM-SlAM Symposium on Discrete Algorithms, held January 12-14, 2003, in Baltimore, Maryland. The Symposium was jointly sponsored by the SIAM Activity Group on Discrete Mathematics and by SIGACT, the ACM Special Interest Group on Algorithms and Computation Theory.In response to the Call for Papers, 331 Long Form abstracts and 77 Short Form Abstracts were submitted. The program committee met "electronically" from July 9 to August 25, 2002, and accepted 92 Long Form abstracts and 20 Short Form abstracts. The decisions were based on originality, technical contribution, and relevance. The submissions were not formally refereed, although every attempt was made to verify the main claims. In addition to the program committee members, many additional reviewers contributed to this effort. It is expected that most of the accepted papers will appear in more complete form in scientific journals.
机译:该卷中的论文在2003年1月12日至14日在马里兰州巴尔的摩举行的第十四届ACM-SlAM离散算法研讨会上发表。该研讨会由SIAM离散数学活动小组和SIGACT,ACM算法与计算理论特别兴趣小组联合主办,响应论文征集,提交了331篇长格式摘要和77篇短格式摘要。程序委员会于2002年7月9日至8月25日举行了“电子会议”,并接受了92个长格式摘要和20个短格式摘要。这些决定基于创意,技术贡献和相关性。尽管已尽一切努力核实主要索赔,但并未正式参考所提交的材料。除了计划委员会成员外,许多其他审阅者也为这项工作做出了贡献。预计大多数被接受的论文将以更完整的形式出现在科学期刊上。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号