The following pages link to (Q3804207):
Displaying 7 items.
- A global parallel algorithm for the hypergraph transversal problem (Q845919) (← links)
- On the complexity of monotone dualization and generating minimal hypergraph transversals (Q943847) (← links)
- The maximum clique problem (Q1318271) (← links)
- An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph (Q1341730) (← links)
- Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem (Q2369979) (← links)
- Parallel Algorithms for Maximal Cliques in Circle Graphs and Unrestricted Depth Search (Q3060200) (← links)
- An Efficient Algorithm to Generate all Maximal Cliques on Trapezoid Graphs (Q3147308) (← links)
