Parsimonious formulations for low-diameter clusters

Network structure and minimum degree

Stephen B. Seidman · Social Networks · 1983 · 1.9K citations

Computing, Computer Science, Mathematics +13

Which Problems Have Strongly Exponential Complexity?

Russell Impagliazzo, Ramamohan Paturi, Francis Zane · Journal of Computer and System Sciences · 2001 · 1.4K citations

Computing, Computer Science, Mathematics +16

On the Complexity of k-SAT

Russell Impagliazzo, Ramamohan Paturi · Journal of Computer and System Sciences · 2001 · 1K citations

Computing, Computer Science, Mathematics +10

Smallest-last ordering and clustering and graph coloring algorithms

David W. Matula, Leland L. Beck · Journal of the ACM · 1983 · 530 citations · Full text

Computing, Computer Science, Algorithms +7

A graph‐theoretic definition of a sociometric clique†

Richard Alba · Journal of Mathematical Sociology · 1973 · 498 citations

Computing, Sociology, Graph Visualization +6