首页    期刊浏览 2024年11月28日 星期四
登录注册

文章基本信息

  • 标题:Embedding Graphs into Embedded Graphs
  • 本地全文:下载
  • 作者:Radoslav Fulek
  • 期刊名称:LIPIcs : Leibniz International Proceedings in Informatics
  • 电子版ISSN:1868-8969
  • 出版年度:2017
  • 卷号:92
  • 页码:34:1-34:12
  • DOI:10.4230/LIPIcs.ISAAC.2017.34
  • 出版社:Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
  • 摘要:A (possibly degenerate) drawing of a graph G in the plane is approximable by an embedding if it can be turned into an embedding by an arbitrarily small perturbation. We show that testing, whether a drawing of a planar graph G in the plane is approximable by an embedding, can be carried out in polynomial time, if a desired embedding of G belongs to a fixed isotopy class, i.e., the rotation system (or equivalently the faces) of the embedding of G and the choice of outer face are fixed. In other words, we show that c-planarity with embedded pipes is tractable for graphs with fixed embeddings. To the best of our knowledge an analogous result was previously known essentially only when G is a cycle.
  • 关键词:Graph embedding; C-planarity; Weakly simple polygons
国家哲学社会科学文献中心版权所有