H. Shen, K. Li and S. Q. Zheng. Separators are as simple as cutsets. Proc. ASIAN'99 (5 th Asian Computer Science Conference) (Phuket, Thailand, December 1999); LNCS 1742 (1999) 347-358. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Representing a Concept Lattice By a Graph - Berry, Sigayret (2002) (Correct)
....relation (see [11] 5] 20] both when one wants to store all the closed sets, and when one simply wants to encounter all of them at least once. 9 In parallel, recent work has been done to generate all the minimal separators or all the minimal xy separators of a graph (see [25] 16] 7] [24]) As an illustration of the use that can be made of our new paradigm, we will show how we can easily match the complexity of generating and storing the closed sets obtained by [20] which is O(n ) per closed set, by using the work of [24] who claims a complexity of O(n ) time per minimal ....
.... minimal xy separators of a graph (see [25] 16] 7] 24] As an illustration of the use that can be made of our new paradigm, we will show how we can easily match the complexity of generating and storing the closed sets obtained by [20] which is O(n ) per closed set, by using the work of [24], who claims a complexity of O(n ) time per minimal xy separator to generate and store them. Let us use our underlying graph GR as described in Section 3, and add two simplicial vertices x and y: x is a neighbor of all vertices of P , y of all vertices of O. The set of minimal separators of ....
[Article contains additional citation context not shown here]
H. Shen. Separators are as simple as cutsets. Asian Computer Science Conference, Purket, Thailand, December 10-13, 1999, Lecture Notes in Computer Science, 172:347358.
Obtaining and Maintaining Polynomial-Sized Concept Lattices - Berry, Sigayret (2002) (Correct)
....A = fa; d; e; f; 3; 4; 5; 6g = S, which shows that S is indeed a minimal separator of GR . c 3 2 4 5 6 f e d a b 1 S C 1 C 2 Figure 3. Separator S = fa; d; e; f; 3; 4; 5; 6g of GR . This enables us to use existing algorithms for generating the minimal separators of a graph (see [21] [20], 15] 5] to efficiently generate the concepts, matching the best complexities of [16] and [9] Moreover, if we add in GR the edges necessary to make S into a clique, defining a new relation R , which is obtained from R by deleting the corresponding crosses, then concept lattice L(R ) is ....
H. Shen. Separators are as simple as cutsets. Asian Computer Science Conference, Purket, Thailand, December 10-13, 1999.
Efficient Concept Generation - Berry, Bordat, Sigayret (Correct)
.... is algorithmically interesting because, in the past decade, much research has been done on using minimal separators to eciently solve various graph problems such as chordal embedding ( 19] 2] and in particular several papers deal with the ecient enumeration of minimal separators ( 14] 21] [20], 3] 4] pointed out that, using the underlying co bipartite graph and these recent results on the emerging theory of minimal separation, the current best algorithms for generating concepts could easily be matched both in terms of time and space. In this paper, we use graph properties to ....
H. Shen. Separators are as simple as cutsets. Asian Computer Science Conference, Purket, Thailand, December 10-13, 1999, Lecture Notes in Computer Science, 172:347-358.
Representing a Concept Lattice By a Graph - Berry, Sigayret (2002) (Correct)
.... to compute the concepts along with their structure, i.e. the arcs of the graph representing the relationships between elements of the lattice (see [10] In parallel, recent work has been done to generate all the minimal separators or all the minimal xy separators of a graph (see [36] 21] 8] [35]) As an illustration of the use that can be made of our new paradigm, we will show how we can easily match the complexity of generating and storing the concepts obtained by [27] which is O(n ) per concept, by using the work of Shen ( 35] who claims a complexity of O(n ) time per minimal ....
.... minimal xy separators of a graph (see [36] 21] 8] 35] As an illustration of the use that can be made of our new paradigm, we will show how we can easily match the complexity of generating and storing the concepts obtained by [27] which is O(n ) per concept, by using the work of Shen ([35]) who claims a complexity of O(n ) time per minimal xy separator to generate and store them. Let us use our underlying graph GR as described in Section 3, and add two simplicial vertices x and y, such that x is a neighbor of all vertices of P, y of all vertices of O. The set of minimal ....
[Article contains additional citation context not shown here]
H. Shen. Separators are as simple as cutsets. Asian Computer Science Conference, Purket, Thailand, December 10-13, 1999.
Concept Lattices and Undirected Graphs - Berry (2004) (Correct)
No context found.
H. Shen, K. Li and S. Q. Zheng. Separators are as simple as cutsets. Proc. ASIAN'99 (5 th Asian Computer Science Conference) (Phuket, Thailand, December 1999); LNCS 1742 (1999) 347-358.
Representing a Concept Lattice By a Graph - Berry, Sigayret (2004) (Correct)
No context found.
H. Shen. Separators are as simple as cutsets. Asian Computer Science Conference, Purket, Thailand, December 10-13, 1999; Lecture Notes in Computer Science 172 (1999) 347358.
Weaving through a Crowd of Minimal Separators - Berry (2003) (Correct)
No context found.
H. Shen. Separators are as simple as cutsets. Asian Computer Science Conference, Purket, Thailand, 172:347-358, 1999.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC