The following pages link to Pascal Préa (Q269172):
Displaying 13 items.
- An optimal algorithm to recognize Robinsonian dissimilarities (Q269174) (← links)
- Distinguishing and classifying from \(n\)-ary properties (Q288890) (← links)
- Totally balanced dissimilarities (Q779024) (← links)
- (Q967974) (redirect page) (← links)
- Distance sequences and percolation thresholds in archimedean tilings (Q967975) (← links)
- Graphs and topologies on discrete sets (Q1197054) (← links)
- About weak connectivity (Q1356780) (← links)
- An optimal algorithm to generate extendable self-avoiding walks in arbitrary dimension (Q1687779) (← links)
- Distance sequences in infinite regular tessellations (Q1903731) (← links)
- Binary set systems and totally balanced hypergraphs (Q2661224) (← links)
- Totally Balanced Formal Context Representation (Q5255656) (← links)
- A Simple and Optimal Algorithm for Strict Circular Seriation (Q5888295) (← links)
- Modules in Robinson Spaces (Q6187080) (← links)