Who dominates whom in the ecosystem? Energy flow bottlenecks and cascading extinctions, Journal of Theoretical Biology, vol.230, issue.3, pp.351-358, 2004. ,
Dominators in Linear Time, SIAM Journal on Computing, vol.28, issue.6, pp.2117-2149, 1999. ,
A simple dynamic algorithm for maintaining a dominator tree, 1996. ,
Fault Equivalence Identification Using Redundancy Information and Static and Dynamic Extraction, Proceedings of the 19th IEEE VLSI Test Symposium, 2001. ,
Fault Tolerant Reachability for Directed Graphs, Lecture Notes in Computer Science, vol.9363, pp.528-543, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01207207
Fault Tolerant Reachability Subgraph: Generic and Optimal, Proc. 48th ACM Symp. on Theory of Computing, pp.509-518, 2016. ,
Two Simplified Algorithms for Maintaining Order in a List, Proc. 10th European Symposium on Algorithms, pp.152-164, 2002. ,
Linear-Time Algorithms for Dominators and Other Path-Evaluation Problems, SIAM Journal on Computing, vol.38, issue.4, pp.1533-1573, 2008. ,
Incremental data flow analysis via dominator and attribute update, Proc. 15th ACM POPL, pp.274-284, 1988. ,
A uniform approach to semi-dynamic problems on digraphs, Theor. Comput. Sci, vol.203, pp.69-90, 1998. ,
Efficiently computing static single assignment form and the control dependence graph, ACM Transactions on Programming Languages and Systems, vol.13, issue.4, pp.451-490, 1991. ,
Two algorithms for maintaining order in a list, Proc. 19th ACM Symp. on Theory of Computing, pp.365-372, 1987. ,
Dynamic graph algorithms, Algorithms and Theory of Computation Handbook, vol.1, pp.9-10, 2009. ,
Finding dominators via disjoint set union, Journal of Discrete Algorithms, vol.23, pp.2-20, 2013. ,
The Minset-Poset Approach to Representations of Graph Connectivity, ACM Transactions on Algorithms, vol.12, issue.2, 2016. ,
A Sparse Algorithm for Predicated Global Value Numbering, SIGPLAN Not, vol.37, issue.5, pp.45-56, 2002. ,
Testing 2-vertex connectivity and computing pairs of vertex-disjoint s-t paths in digraphs, Proc. 37th Int'l. Coll. on Automata, Languages, and Programming, pp.738-749, 2010. ,
Approximating the Smallest 2-Vertex Connected Spanning Subgraph of a Directed Graph, Proc. 19th European Symposium on Algorithms, pp.13-24, 2011. ,
URL : https://hal.archives-ouvertes.fr/hal-02335015
Incremental Low-High Orders of Directed Graphs and Applications, 16th International Symposium on Experimental Algorithms (SEA 2017), vol.75, pp.1-27, 2017. ,
Decremental Data Structures for Connectivity and Dominators in Directed Graphs, ICALP, vol.42, p.15, 2017. ,
2-Edge Connectivity in Directed Graphs, Proc. 26th ACM-SIAM Symp. on Discrete Algorithms, 1988. ,
2-Vertex Connectivity in Directed Graphs, Proc. 42nd Int'l. Coll. on Automata, Languages, and Programming, pp.605-616, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01925966
An Experimental Study of Dynamic Dominators, Proc. 20th European Symposium on Algorithms, pp.491-502, 2012. ,
Incremental 2-Edge-Connectivity in Directed Graphs, ICALP, vol.49, p.15, 2016. ,
Dominator Tree Certification and Divergent Spanning Trees, ACM Transactions on Algorithms, vol.12, issue.1, 2015. ,
Addendum to "Dominator Tree Certification and Divergent Spanning Trees, ACM Transactions on Algorithms, vol.12, issue.4, 2016. ,
Finding Dominators in Practice, Journal of Graph Algorithms and Applications (JGAA), vol.10, issue.1, pp.69-94, 2006. ,
Influence Maximization in Continuous Time Diffusion Networks, 29th International Conference on Machine Learning (ICML), 2012. ,
A decomposition theorem and two algorithms for reticulation-visible networks, Information and Computation, vol.252, pp.161-175, 2017. ,
Characterizations of Reducible Flow Graphs, Journal of the ACM, vol.21, issue.3, pp.367-375, 1974. ,
Finding 2-edge and 2-vertex strongly connected components in quadratic time, Proc. 42nd Int'l. Coll. on Automata, Languages, and Programming, pp.713-724, 2015. ,
Finding strong bridges and strong articulation points in linear time, Theoretical Computer Science, vol.447, pp.74-84, 2012. ,
Computing the 2-blocks of directed graphs, RAIRO-Theor. Inf. Appl, vol.49, issue.2, pp.93-119, 2015. ,
On computing the 2-vertex-connected components of directed graphs, Discrete Applied Mathematics, vol.204, pp.164-172, 2016. ,
KONECT: the Koblenz network collection, 22nd International World Wide Web Conference, WWW '13, pp.1343-1350, 2013. ,
A Fast Algorithm for Finding Dominators in a Flowgraph, ACM Transactions on Programming Languages and Systems, vol.1, issue.1, pp.121-162, 1979. ,
SNAP Datasets: Stanford large network dataset collection, 2014. ,
Diagnosing memory leaks using graph mining on heap dumps, Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '10, pp.115-124, 2010. ,
Certifying algorithms, Computer Science Review, vol.5, issue.2, pp.119-161, 2011. ,
Using Dominators for Solving Constrained Path Problems, Proc. 8th International Conference on Practical Aspects of Declarative Languages, pp.73-87, 2006. ,
An incremental algorithm for maintaining the dominator tree of a reducible flowgraph, POPL, pp.287-296, 1994. ,
Incremental computation of dominator trees, ACM Transactions on Programming Languages and Systems, vol.19, pp.239-252, 1997. ,
Finding Dominators in Directed Graphs, SIAM Journal on Computing, vol.3, issue.1, pp.62-89, 1974. ,
Testing Flow Graph Reducibility, J. Comput. Syst. Sci, vol.9, issue.3, pp.80049-80057, 1974. ,
Linear time algorithms for two disjoint paths problems on directed acyclic graphs, Theoretical Computer Science, vol.465, pp.35-48, 2012. ,
Mechanized Verification of Computing Dominators for Formalizing Compilers, Proc. 2nd International Conference on Certified Programs and Proofs, pp.27-42, 2012. ,