We present SNAP (Small-world Network Analysis and Partitioning), an open-source graph framework for exploratory study and partitioning of large-scale networks. To illustrate the c...
The first polynomial time algorithm (O(n4 )) for modular decomposition appeared in 1972 [8] and since then there have been incremental improvements, eventually resulting in linear...
Michel Habib, Fabien de Montgolfier, Christophe Pa...
We describe an approach for interactive collision detection and proximity computations on massive models composed of millions of geometric primitives. We address issues related to...
Andy Wilson, Eric Larsen, Dinesh Manocha, Ming C. ...
Boolean functions are fundamental to synthesis and verification of digital logic, and compact representations of Boolean functions have great practical significance. Popular repre...
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...
Erik D. Demaine, MohammadTaghi Hajiaghayi, Bojan M...