Fluorous chemistry has been in the focus of research interests since the end of the last century. One of the most important contributions in the field was the article Facile Catalyst Separation Without Water: Fluorous Biphase Hydroformylation of Olef ins by Istvań T. Horvath and Joźsef Rabai. It has had great impact on academic chemical research. According to Web of Science (downloaded on 31 January 2017), in more than two decades, 2384 researchers have cited this work in 1077 scientific documents. In the present paper, we illustrate and analyze the co-authorship network determined by these citing documents. We studied the statistical features of these publications, as well as the macro-and micro-characteristics of the network using standard social network analysis techniques. We also interpret the results from a chemical point of view.
Twenty years ago Kenso Soai et al. published their important paper "Asymmetric autocatalysis and amplification of enantiomeric excess of a chiral molecule" in Nature. Their findings launched a new chapter in the natural sciences. According to www.scholar.google.com data (downloaded on 15 May 2015) in the past 20 years 929 researchers have referred to this work in 594 scientific documents of which 557 were written in the Latin alphabet. In the present paper we illustrate and analyze the social structure determined by these 557 articles and books by the use of graph theoretical tools and analysis of social networks.
Abstract. We give algorithms for the directed minimum odd or even cut problem and certain generalizations. Our algorithms improve on the previous best ones of Goemans and Ramakrishnan by a factor of O(n) (here n is the size of the ground vertex set). Our improvements apply among others to the minimum directed Todd or T-even cut and to the directed minimum Steiner cut problems. The (slightly more general) result of Goemans and Ramakrishnan shows that a collection of minimal minimizers of a submodular function (i.e. minimum cuts) contains the odd minimizers. In contrast our algorithm selects an n-times smaller class of not necessarily minimal minimizers and out of these sets we construct the odd minimizer. If M (n, m) denotes the time of a u-v minimum cut computation in a directed graph with n vertices and m edges, then we may find a directed minimum -odd or T-odd cut withThe key of our construction is a so-called parity uncrossing step that, given an arbitrary set system with odd intersection, finds an odd set with value not more than the maximum of the initial system.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.