The following pages link to (Q3685231):
Displayed 20 items.
- Hamiltonian cycles in linear-convex supergrid graphs (Q335338) (← links)
- The Hamiltonian properties of supergrid graphs (Q497690) (← links)
- Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs (Q628259) (← links)
- An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs (Q719277) (← links)
- A linear time algorithm for computing the convex hull of an ordered crossing polygon (Q792775) (← links)
- A unified approach to pattern recognition (Q799126) (← links)
- Tridiagonal factorizations of Fourier matrices and applications to parallel computations of discrete Fourier transforms (Q1103363) (← links)
- Implicit moment particle simulation of plasmas (Q1157272) (← links)
- Constructing the relative neighborhood graph in 3-dimensional Euclidean space (Q1175789) (← links)
- Abstract sphere-of-influence graphs (Q1310234) (← links)
- Sphere of influence graphs: Edge density and clique size (Q1339834) (← links)
- Sphere of influence graphs in general metric spaces (Q1596920) (← links)
- Optimal reference subset selection for nearest neighbor classification by tabu search (Q1601565) (← links)
- Finding a largest rectangle inside a digital object and rectangularization (Q1747507) (← links)
- The Hamiltonian connectivity of rectangular supergrid graphs (Q1751246) (← links)
- Sphere of influence graphs and the \(L_{\infty}\)-metric (Q1811067) (← links)
- Recognition of spatial point patterns (Q1838328) (← links)
- On using prototype reduction schemes to enhance the computation of volume-based inter-class overlap measures (Q2270741) (← links)
- An Algorithm to Compute Any Simple $k$-gon of a Maximum Area or Perimeter Inscribed in a Region of Interest (Q5056924) (← links)
- Sphere-of-influence graphs using the sup-norm (Q5927945) (← links)