On semi-transitive orientability of split graphs
INFORMATION PROCESSING LETTERS（2024）
摘要
A directed graph is semi-transitive if and only if it is acyclic and for any directed path u(1)-> u(2)->& ctdot;-> u(t), t >= 2, either there is no edge from u1 to ut or all edges u(i)-> u(j) exist for 1 <= i更多
查看译文
关键词
Semi-transitive orientation,Split graph,Polynomial solvability,Circular ones property,Computational complexity
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要