ヒント: 日本語の検索結果のみ表示します。検索言語は [表示設定] で指定できます
In this paper, we show that the treewidth and pathwidth of a permutation graph can be computed in polynomial time. In fact we show that, for permutation graphs, ...
ON COMPARABILITY AND PERMUTATION GRAPHS. 659. An undirected graph G is a permutation graph if there is some pair of permutations of the vertex set P, P: such ...
This paper presents a technique for orienting a comparability graph transitively in $O(n^2 )$ time. The best previous algorithm for this problem required ...
Comparability and permutation graphs - SageMath Documentation
doc.sagemath.org › html › graphs › sage
A graph is a comparability graph if it can be obtained from a poset by adding an edge between any two elements that are comparable. Co-comparability graph are ...
This paper presents a technique for orienting a comparability graph transitively in $O(n^2 )$ time. The best previous algorithm for this problem required ...
This paper presents a technique for orienting a comparability graph transitively in O(n2) time. The best previous algorithm for this problem required (n3) time.
On Comparability and Permutation Graphs ; 資料種別: 記事 ; 著者: Jeremy Spinrad ; 出版者: Society for Industrial & Applied Mathematics (SIAM) ; 出版年: 1985-08.
On comparability and permutation graphs. 被引用文献3件. SPINRAD J. 収録刊行物. SIAM J. Comput. SIAM J. Comput. 14 658-670, 1985. 被引用文献 (3)*注記. 読み込み中 ...
Permutation graphs are a special case of circle graphs, comparability graphs, the complements of comparability graphs, and trapezoid graphs. The subclasses ...
A graph is a permutation graph if it is both a comparability graph and a co-comparability graph. For more information on permutation graphs, ...