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