The following pages link to Anne Berry (Q193585):
Displaying 43 items.
- Organizing the atoms of the clique separator decomposition into an atom tree (Q406311) (← links)
- The Dilworth number of auto-chordal bipartite graphs (Q497341) (← links)
- A general label search to investigate classical graph search algorithms (Q617648) (← links)
- A vertex incremental approach for maintaining chordality (Q819824) (← links)
- Separability generalizes Dirac's theorem (Q1392561) (← links)
- Graph extremities defined by search algorithms (Q1662546) (← links)
- An introduction to clique minimal separator decomposition (Q1662549) (← links)
- Computing a clique tree with the algorithm maximal label search (Q1662609) (← links)
- The normal graph conjecture for two classes of sparse graphs (Q1706428) (← links)
- Maximum cardinality search for computing minimal triangulations of graphs (Q1882406) (← links)
- Representing a concept lattice by a graph (Q1885806) (← links)
- A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph (Q1944936) (← links)
- Hermes: a simple and efficient algorithm for building the AOC-poset of a binary relation (Q2254614) (← links)
- Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds (Q2341752) (← links)
- Sequential and parallel triangulating algorithms for elimination game and new insights on minimum degree (Q2378540) (← links)
- A local approach to concept generation (Q2385441) (← links)
- Generalized domination in closure systems (Q2489652) (← links)
- Maximal sub-triangulation in pre-processing phylogenetic data (Q2500753) (← links)
- (Q2708230) (← links)
- (Q2721974) (← links)
- (Q2816011) (← links)
- The Normal Graph Conjecture for Classes of Sparse Graphs (Q2864291) (← links)
- A Peep through the Looking Glass: Articulation Points in Lattices (Q2907459) (← links)
- Extremities and orderings defined by generalized graph search algorithms (Q3439374) (← links)
- Recognizing Chordal Probe Graphs and Cycle-Bicolorable Graphs (Q3519195) (← links)
- Performances of Galois Sub-hierarchy-building Algorithms (Q3590977) (← links)
- (Q4252378) (← links)
- (Q4414480) (← links)
- (Q4709056) (← links)
- Dismantlable Lattices in the Mirror (Q4924384) (← links)
- (Q4944976) (← links)
- Maximal Label Search Algorithms to Compute Perfect and Minimal Elimination Orderings (Q5189528) (← links)
- Algorithms and Computation (Q5191632) (← links)
- Triangulation and Clique Separator Decomposition of Claw-Free Graphs (Q5200490) (← links)
- GENERATING ALL THE MINIMAL SEPARATORS OF A GRAPH (Q5249047) (← links)
- A wide-range algorithm for minimal triangulation from an arbitrary ordering (Q5468869) (← links)
- (Q5501362) (← links)
- Formal Concept Analysis (Q5710378) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5897556) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5897577) (← links)
- Formal Concept Analysis (Q5898492) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5902510) (← links)
- Asteroidal triples of moplexes (Q5939228) (← links)
