The following pages link to Jorge Artieda (Q526418):
Displaying 5 items.
- A parallel maximum clique algorithm for large and massive sparse graphs (Q526419) (← links)
- Visual 3-D SLAM from uavs (Q614677) (← links)
- Efficiently enumerating all maximal cliques with bit-parallelism (Q1651581) (← links)
- A new branch-and-bound algorithm for the maximum weighted clique problem (Q2002840) (← links)
- An enhanced bitstring encoding for exact maximum clique search in sparse graphs (Q5268925) (← links)
