Dominance Drawings for DAGs with Bounded Modular Width

SOFSEM 2023: Theory and Practice of Computer Science(2023)

引用 0|浏览6
暂无评分
摘要
A weak dominance drawing $$\varGamma $$ of a DAG $$G=(V,E)$$ is a d-dimensional drawing such that $$D(u) 更多
查看译文
关键词
Modular width, (Weak) dominance drawings, FPT-algorithms
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要