Temporalizing digraphs via linear-size balanced bi-trees

Stéphane Bessy,Stéphan Thomassé,Laurent Viennot

Symposium on Theoretical Aspects of Computer Science（2023）

引用 0|浏览9

暂无评分

摘要

In a directed graph $D$ on vertex set $v_1,\dots ,v_n$, a \emph{forward arc} is an arc $v_iv_j$ where $i0$ such that one can always find an enumeration realizing $c.|R|$ forward connected pairs $\{x_i,y_i\}$ (in either direction).

查看译文

关键词

digraphs,linear-size,bi-trees

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要