A. Berry and J.-P. Bordat. Clique minimal separator decomposition. Research Report 97-213, LIRMM, 1997. 94 Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Graph Extremities and Minimal Separation - Berry (2003) Self-citation (Berry) (Correct)
No context found.
A. Berry and J.-P. Bordat. Clique minimal separator decomposition. Research Report 97-213, LIRMM, 1997. 94
Representing a Concept Lattice By a Graph - Berry, Sigayret (2004) Self-citation (Berry) (Correct)
No context found.
A. Berry and J.-P. Bordat. Clique minimal separator decomposition. Research Report 97213, LIRMM (1997).
Representing a Concept Lattice By a Graph - Berry, Sigayret (2002) Self-citation (Berry) (Correct)
....minimal separator of G, de ning components C 1 ; C 2 ; C k . Replace G with G 1 = G(C 1 [ N(C 1 ) G 2 = G(C 2 [ N(C 2 ) and G k = G(C k [ N(C k ) This decomposition has the remarkable property that it distributes the minimal separators into the subgraphs it de nes. Property 5. 2 ([6]) Let G be a graph, let S be a clique minimal separator of G, let S(G) be the set of minimal separators of G. After a decomposition step of G by S, the elements of S(G) fSg are partitioned into the subgraphs obtained. 5.2 Minimal separator decomposition of a co bipartite graph In the case of ....
A. Berry and J.-P. Bordat. Clique minimal separator decomposition. Research Report 97213, LIRMM, 1997.
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