Abstract: We describe a new method for visualization of directed graphs. The method combines constraint programming techniques with a high ... digraphs than the most widely used hierarchical ...

The really cool thing about this CPU is that it eschews the typical program counter (PC) and replaces it with a linear-feedback shift register (LFSR). Apparently an LFSR can be implemented in ...

Abstract: A seminal work of [Ahn-Guha-McGregor, PODS’12] showed that one can compute a cut sparsifier of an unweighted undirected graph by taking a near-linear number of linear measurements on the ...