CLIP
From MaRDI portal
Cited in
(7)- The second largest number of maximal independent sets in connected graphs with at most one cycle
- Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem
- Solving the maximum clique problem with symmetric rank-one non-negative matrix approximation
- Algorithms for finding maximum transitive subtournaments
- Homothetic polygons and beyond: maximal cliques in intersection graphs
- scientific article; zbMATH DE number 6257565 (Why is no real title available?)
- Clique-detection models in computational biochemistry and genomics
This page was built for software: CLIP
