The following pages link to (Q4871155):
Displaying 9 items.
- Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited (Q899436) (← links)
- Facet defining inequalities among graph invariants: The system graphedron (Q944740) (← links)
- Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures (Q1422414) (← links)
- Principles of human-computer collaboration for knowledge discovery in science (Q1606346) (← links)
- Automated conjecturing. III. Property-relations conjectures (Q1688717) (← links)
- Computers and discovery in algebraic graph theory (Q1855400) (← links)
- Automated conjectures on upper bounds for the largest Laplacian eigenvalue of graphs (Q2369038) (← links)
- A Graph Theoretic Formula for the Number of Primes $\pi(n)$ (Q5148772) (← links)
- Variable neighborhood search: Principles and applications (Q5937708) (← links)
