Why do algorithms keep showing us content we claim not to want? The answer isn’t manipulation—it’s conflict between our ...

Abstract: We present CLIPPER+, an algorithm for finding maximal cliques in unweighted graphs for outlier-robust global registration. The registration problem can be formulated as a graph and solved by ...

Abstract: The maximum clique problem (MCP) is a fundamental problem in combinatorial optimization which finds important applications in real-word. This paper describes two new efficient ...

After years of bipartisan attacks on TikTok and its parent company ByteDance, which for a time included an effort to potentially ban the social media app in the U.S., a new U.S. TikTok spinoff has ...

Clique relaxation problems are important extension versions of the maximum clique problem with extensive real-world applications. Although lots of studies focus on designing local search algorithms ...

Sudoku fan? After diving into the math behind the game, test your skills with our very own puzzles in SciAm Games! Computer science seemingly rides a curve of unstoppable progress. Mere decades took ...

We introduce a new algorithm MaxCliqueWeight for identifying a maximum weight clique in a weighted graph, and its variant MaxCliqueDynWeight with dynamically varying bounds. This algorithm uses an ...

On March 15, intriguing seminar announcements sent rumblings through the field of combinatorics, the mathematical study of counting. Three collaborators planned to give coordinated talks the following ...

This article will look into few important concepts - clique, chromatic number and perfect graph. Before we delve into these concepts, let us revisit a concept that we already introduced in a fleeting ...

This contribution is part of the special series of Inaugural Articles by members of the National Academy of Sciences elected in 2009. Contributed by Christos Papadimitriou, September 12, 2014 (sent ...