《区间图、弦图和完美图》-精选（公开课件）.pptVIP

* * * * * * * * * * * * * * * * * * * * * * * * * * * * * 区间图的判定 N = 4 S1={2, 3} {1,2,3,4,1,3,2,4,1,4,2,3,1,4,3,2,2,3,1,4,2,3,4,1,3,2,1,43,2,4,1,4,1,2,3,4,1,3,2,4,2,3,1,4,3,2,1} S2={3, 4} {1,2,3,4,1,4,3,2,2,3,4,1,4,3,2,1} 区间图的判定 PQ-tree /2008/11/pq-tree-algorithm-and-consecutive-ones.html http://www.jharris.ca/portfolio/code/pqtree/PQTree.html 区间图的判定 pertinent-root 区间图的判定 L1 当前节点是叶子 标记为full 区间图的判定 P1 当前节点是P-node,子节点都是full 标记为full 区间图的判定 P2 P-node,pertinent-root,full + empty 增加新的P-node作为full子节点的父节点及当前节点的子节点(如果只有1个full子节点则不增加新的P-node) 区间图的判定 P3 P-node,not pertinent-root,full + empty 当前节点标记为part