The following pages link to Geneviève Simonet (Q406310):
Displaying 16 items.
- Organizing the atoms of the clique separator decomposition into an atom tree (Q406311) (← links)
- (Q617647) (redirect page) (← links)
- A general label search to investigate classical graph search algorithms (Q617648) (← links)
- On the complexity of entailment in existential conjunctive first-order logic with atomic negation (Q714500) (← links)
- On Stein's paper: Resolving ambiguity in nonmonotonic inheritance hierarchies (Q1341669) (← 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)
- Sequential and parallel triangulating algorithms for elimination game and new insights on minimum degree (Q2378540) (← links)
- Extremities and orderings defined by generalized graph search algorithms (Q3439374) (← links)
- (Q4218272) (← links)
- Functional completeness of the free locally Cartesian closed category and interpretations of Martin-Löf's theory of dependent types (Q4715672) (← links)
- Maximal Label Search Algorithms to Compute Perfect and Minimal Elimination Orderings (Q5189528) (← links)
- A wide-range algorithm for minimal triangulation from an arbitrary ordering (Q5468869) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5897556) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5902510) (← links)
