MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for authors named "Anne Berry" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 31 documents found, showing 1 through 10. Next 10 →
ATOM RSS
  • Weaving through a Crowd of Minimal Separators  
  • by Anne Berry — 2003
  • …this paper, he introduces both simplicial vertices (which he does not name) and minimal separators, which he calls relatively minimal cutsets…
  • Add To MetaCart
  • A Wide-Range Efficient Algorithm For Minimal Triangulation  
  • by Anne Berry — 1999 — Proceedings of SODA'99
  • …Traditionally, efficient algorithms for computing a minimal triangulation of a graph (i.e. embedding a graph into a triangulated graph by adding an inclusion-minimal set of edges) required first computing a special ordering on the vertices of the graph, called a minimal ordering. We give a new algor…
  • Cited by 18 (8 self) – Add To MetaCart
  • Representing a Concept Lattice By a Graph  
  • by Anne Berry, Alain Sigayret — 2004 — Proceedings of Discrete Maths and Data Mining Workshop, 2nd SIAM Conference on Data Mining (SDM'02
  • …Concept lattices (also called Galois lattices) are an ordering of the maximal rectangles dened by a binary relation. In this paper, we present a new relationship between lattices and graphs: given a binary relation R, we dene an underlying graph GR , and establish a one-to-one correspondence between…
  • Cited by 18 (13 self) – Add To MetaCart
  • Maintaining Class Membership Information  
  • by Anne Berry, Alain Sigayret — 2002 — Proceedings Workshop MASPEGHI (MAnaging of SPEcialization/Generalization HIerarchies) LNCS proceedings of OOIS 02 (Object-Oriented Information Systems
  • …Galois lattices (or concept lattices), which are lattices built on a binary relation, are now used in many fields, such as Data Mining and hierarchy organization, but may be of exponential size. In this paper, we propose a decomposition of a Galois sub-hierarchy which is of small size but contains u…
  • Cited by 5 (4 self) – Add To MetaCart
  • Separability generalizes Dirac's theorem  
  • by Anne Berry, Jean-paul Bordat — 1998
  • …In our study of the extremities of a graph, we define a moplex as a maximal clique module the neighborhood of which is a minimal separator of the graph. This notion enables us to strengthen Dirac's theorem (Dirac, 1961): "Every non-clique triangulated graph has at least two non-adjacent simplicial v…
  • Cited by 16 (11 self) – Add To MetaCart
  • Recognizing Weakly Triangulated Graphs by Edge Separability  
  • by Anne Berry, Jean-Paul Bordat — 2000
  • …. We apply Lekkerkerker and Boland's recognition algorithm for triangulated graphs to the class of weakly triangulated graphs. This yields a new characterization of weakly triangulated graphs, as well as a new O(m 2 ) recognition algorithm which, unlike the previous ones, is not based on the notio…
  • Cited by 25 (13 self) – Add To MetaCart
  • Obtaining and Maintaining Polynomial-Sized Concept Lattices  
  • by Anne Berry, Alain Sigayret — 2002
  • …We use our definition of an underlying co-bipartite graph which encodes a given binary relation to propose a new approach to defining a sub-relation or incrementally maintaining a relation which will define only a polynomial number of concepts.…
  • Cited by 5 (3 self) – Add To MetaCart
  • Asteroidal Triples of Moplexes  
  • by Anne Berry, Jean-paul Bordat — 2000 — Discrete Applied Mathematics
  • …An asteroidal triple is an independent set of vertices such that each pair is joined by a path that avoids the neighborhood of the third, and a moplex is an extension to an arbitrary graph of a simplicial vertex in a triangulated graph. The main result of this paper is that the investigation of the …
  • Cited by 6 (5 self) – Add To MetaCart
  • Decomposition By Clique Minimal Separators  
  • by Anne Berry, Jean-paul Bordat — 1999 — Res. Rep. 97213
  • …Clique decomposition consists in repeatedly finding a clique, the removal of which leaves the graph disconnected, and copying this clique into each of the connected components thus defined. This was implemented efficiently by Tarjan in 1985, and is an important tool for a Divide and Conquer appr…
  • Cited by 3 (2 self) – Add To MetaCart
  • Moplex Elimination Orderings  
  • by Anne Berry, Jean-paul Bordat — 2001 — First Cologne-Twente Workshop on Graphs
  • …Classically, triangulated graphs are characterized and recognized by way of perfect elimination orderings (peo, which correspond to an elimination scheme on simplicial vertices). Algorithm LexBFS computes such a peo eciently, but is also useful for the enumeration of the minimal separators and maxim…
  • Cited by 5 (2 self) – Add To MetaCart
Help! Showing 1 through 10. Next 10 →
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB