An Eulerian circuit in a directed graph is one of the most fundamental Graph Theory notions. Detecting if G has unique can be done polynomial time via BEST theorem by de Bruijn, van Aardenne-Ehrenfest, Smith and Tutte (1941–1951) [15], [16] (involving counting arborescences), or tailored characterization Pevzner, 1989 computing intersection simple cycles G), both which thus rely on overly compl...

We review the present status of the null cone approach to numerical evolution being developed by the Pittsburgh group. We describe the simplicity of the underlying algorithm as it applies to the global description of general relativistic spacetimes. We also demonstrate its effectiveness in revealing asymptotic physical properties of black hole formation in the gravitational collapse of a scalar...

There are many indicators to suggest that Americans feel technology is complicating their lives. These range from the growing strength of the voluntary simplicity movement [Elgin 1998] and the slew of popular books on “unplugging” [Brende 2004] to research showing that many consumers are overwhelmed by the increasing complexity of daily living [Breen-Pierce & Robin 2000]. In response, many indi...