Approximating Transitive Reductions for Directed Networks
暂无分享,去创建一个
[1] Salil P. Vadhan,et al. Computational Complexity , 2005, Encyclopedia of Cryptography and Security.
[2] Samir Khuller,et al. On Strongly Connected Digraphs with Bounded Cycle Length , 1996, Discret. Appl. Math..
[3] Marek Karpinski,et al. TSP with bounded metrics , 2006, J. Comput. Syst. Sci..
[4] Eduardo D. Sontag,et al. NET-SYNTHESIS: a software for synthesis, inference and simplification of signal transduction networks , 2008, Bioinform..
[5] Richard M. Karp,et al. A simple derivation of Edmonds' algorithm for optimum branchings , 1971, Networks.
[6] Samir Khuller,et al. A uniform framework for approximating weighted connectivity problems , 1999, SODA '99.
[7] Marek Karpinski,et al. Approximation Hardness of Short Symmetric Instances of MAX-3SAT , 2003, Electron. Colloquium Comput. Complex..
[8] Alfred V. Aho,et al. The Transitive Reduction of a Directed Graph , 1972, SIAM J. Comput..
[9] Riccardo Dondi,et al. A Novel Method for Signal Transduction Network Inference from Indirect Experimental Evidence , 2007, WABI.
[10] Riccardo Dondi,et al. Inferring (Biological) Signal Transduction Networks via Transitive Reductions of Directed Graphs , 2008, Algorithmica.
[11] Jens Vygen,et al. The Book Review Column1 , 2020, SIGACT News.
[12] Adrian Vetta,et al. Approximating the minimum strongly connected subgraph via a matching lower bound , 2001, SODA '01.
[13] Samir Khuller,et al. Approximating the minimum equivalent digraph , 1994, SODA '94.
[14] Gerald L. Thompson,et al. An Algorithm for Finding a Minimum Equivalent Graph of a Digraph , 1969, J. ACM.
[15] Joseph JáJá,et al. Approximation Algorithms for Several Graph Augmentation Problems , 1981, SIAM J. Comput..
[16] Cécile Bothorel,et al. Transitive reduction for social network analysis and visualization , 2005, The 2005 IEEE/WIC/ACM International Conference on Web Intelligence (WI'05).