首页> 外文会议>Fundamentals of computation theory >Reachability in K_(3,3)-Free Graphs and K_5-Free Graphs Is in Unambiguous Log-Space
【24h】

Reachability in K_(3,3)-Free Graphs and K_5-Free Graphs Is in Unambiguous Log-Space

机译:无K_(3,3)图和K_5无图的可达性在明确的日志空间中

获取原文
获取原文并翻译 | 示例

摘要

We show that the reachability problem for directed graphs that are either K_(3,3)-free or K_5-free is in unambiguous log-space, UL ∩ coUL. This significantly extends the result of Bourke, Tewari, and Vin-odchandran that the reachability problem for directed planar graphs is in UL∩ coUL.
机译:我们表明,无K_(3,3)或无K_5的有向图的可达性问题在明确的日志空间UL∩coUL中。这大大扩展了Bourke,Tewari和Vin-odchandran的结果,即有向平面图的可及性问题在于UL∩coUL。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号