K. Ravindra, . Ahuja, L. Thomas, J. B. Magnanti, and . Orlin, , 1988.

K. Ravindra, . Ahuja, L. Thomas, J. B. Magnanti, M. R. Orlin et al., Applications of network optimization, Handbooks in Operations Research and Management Science, vol.7, pp.1-83, 1995.

E. M. Arkin, H. Meijer, J. S. Mitchell, D. Rappaport, and S. Skiena, Decision trees for geometric models, Int. J. Comput. Geometry Appl, vol.8, issue.3, pp.343-364, 1998.

S. Arora, E. Hazan, and S. Kale, The multiplicative weights update method: a meta-algorithm and applications, Theory of Computing, vol.8, pp.121-164, 2012.

L. Becchetti, V. Bonifaci, M. Dirnberger, A. Karrenbauer, and K. Mehlhorn, Physarum can compute shortest paths: Convergence proofs and complexity bounds, International Colloquium on Automata, Languages, and Programming, pp.472-483, 2013.

L. Becchetti, V. Bonifaci, and E. Natale, Pooling or sampling: Collective dynamics for electrical flow estimation, Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, pp.1576-1584, 2018.
URL : https://hal.archives-ouvertes.fr/hal-02002536

Y. Ben, -. Asher, and E. Farchi, The cost of searching in general trees versus complete binary trees, 1997.

M. Ben, -. , and A. Hassidim, The bayesian learner is optimal for noisy binary search (and pretty good for quantum as well), 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS, pp.221-230, 2008.

C. Berge, Graphes et hypergraphes. Dunod, 1970.

L. J. Billera, Clutter decomposition and monotonic boolean functions. Annals of the New, 1970.

L. J. Billera, On the composition and decomposition of clutters, Journal of Combinatorial Theory, Series B, vol.11, issue.3, pp.234-245, 1971.

J. C. Bioch, The complexity of modular decomposition of boolean functions, Discrete Applied Mathematics, vol.149, issue.1-3, pp.1-13, 2005.

P. Bonizzoni and G. Vedova, An algorithm for the modular decomposition of hypergraphs, J. Algorithms, vol.32, issue.2, pp.65-86, 1999.

P. S. Bonsma, The complexity of the matching-cut problem for planar graphs and other graph classes, Journal of Graph Theory, vol.62, issue.2, pp.109-126, 2009.

M. Borassi, P. Crescenzi, and M. Habib, Into the square: On the complexity of some quadratic-time solvable problems, Electr. Notes Th. Comp. Sci, vol.322, pp.51-67, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01390131

Y. Yuri, M. Boykov, and . Jolly, Interactive graph cuts for optimal boundary & region segmentation of objects in nd images, Proceedings eighth IEEE international conference on computer vision. ICCV, vol.1, pp.105-112, 2001.

R. Carmo, J. Donadelli, Y. Kohayakawa, and E. S. Laber, Searching in random partially ordered sets, Theor. Comput. Sci, vol.321, issue.1, pp.41-57, 2004.

P. Charbit, M. Habib, V. Limouzy, M. Fabien-de-montgolfier, M. Raffinot et al., A note on computing set overlap classes, Inf. Process. Lett, vol.108, issue.4, pp.186-191, 2008.
URL : https://hal.archives-ouvertes.fr/lirmm-00325371

M. Chein, M. Habib, and M. C. Maurer, Partitive hypergraphs. Discrete Mathematics, vol.37, pp.35-50, 1981.

P. Christiano, J. A. Kelner, A. Madry, A. Daniel, S. Spielman et al., Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs, Proceedings of the forty-third annual ACM symposium on Theory of computing, pp.273-282, 2011.

V. Chvátal, Recognizing decomposable graphs, Journal of Graph Theory, vol.8, issue.1, pp.51-53, 1984.

F. Cicalese, T. Jacobs, E. S. Laber, and M. Molinaro, On the complexity of searching in trees and partially ordered structures, Theor. Comput. Sci, vol.412, issue.50, pp.6879-6896, 2011.

F. Cicalese and T. Jacobs, Eduardo Sany Laber, and Caio Dias Valentim. The binary identification problem for weighted trees, Theor. Comput. Sci, vol.459, pp.100-112, 2012.

F. Cicalese, B. Keszegh, B. Lidický, D. Pálvölgyi, and T. Valla, On the tree search problem with non-uniform costs, 2014.

D. G. Corneil, H. Lerchs, and L. S. Burlingham, Complement reducible graphs, Discrete Applied Mathematics, vol.3, issue.3, pp.163-174, 1981.

B. Courcelle, A monadic second-order definition of the structure of convex hypergraphs, Inf. Comput, vol.178, issue.2, pp.391-411, 2002.

E. Dahlhaus, Parallel algorithms for hierarchical clustering and applications to split decomposition and parity graph recognition, J. Algorithms, vol.36, issue.2, pp.205-240, 2000.

D. Dereniowski, Edge ranking of weighted trees, Discrete Applied Mathematics, vol.154, issue.8, pp.1198-1209, 2006.

D. Dereniowski, Edge ranking and searching in partial orders, Discrete Applied Mathematics, vol.156, issue.13, pp.2493-2500, 2008.

D. Dereniowski and M. Kubale, Efficient parallel query processing by graph ranking, Fundam. Inform, vol.69, issue.3, pp.273-285, 2006.

D. Dereniowski and A. Nadolski, Vertex rankings of chordal graphs and weighted trees, Inf. Process. Lett, vol.98, issue.3, pp.96-100, 2006.

D. Dereniowski, S. Tiegel, P. Uzna?ski, and D. Wolleb-graf, A framework for searching in graphs in the presence of errors, 2018.

G. Peter, J. Doyle, and . Snell, Random walks and electric networks, vol.22, 1984.

E. Corel, P. Lopez, R. Meheust, and B. E. , Network-thinking: Graphs to analyze microbial complexity and evolution, Trends Microbiol, vol.24, issue.3, pp.224-237, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01300043

E. Corel, R. Meheust, A. K. Watson, J. O. Mcinerney, P. Lopez et al., Bipartite network analysis of gene sharings in the microbial world, Mol. Biol Evol, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01798030

J. Edmonds, M. Richard, and . Karp, Theoretical improvements in algorithmic efficiency for network flow problems, Journal of the ACM (JACM), vol.19, issue.2, pp.248-264, 1972.

E. Emamjomeh-zadeh, D. Kempe, and V. Singhal, Deterministic and probabilistic binary search in graphs, Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, pp.519-532, 2016.

U. Feige, P. Raghavan, D. Peleg, and E. Upfal, Computing with noisy information, SIAM J. Comput, vol.23, issue.5, pp.1001-1018, 1994.

L. R. Ford and D. R. Fulkerson, Maximal flow through a network, Canadian Journal of Mathematics, vol.8, pp.399-404, 1956.

J. Gajarsk?, M. Lampis, and S. Ordyniak, Parameterized algorithms for modular-width, International Symposium on Parameterized and Exact Computation, pp.163-176, 2013.

T. Gallai, Transitiv orientierbare Graphen, Acta Mathematica Academiae Scientiarum Hungaricae, vol.18, pp.25-66, 1967.

M. Ghaffari, A. Karrenbauer, F. Kuhn, C. Lenzen, and B. Patt-shamir, Near-optimal distributed maximum flow, Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, pp.81-90, 2015.

C. Archontia, P. Giannopoulou, D. M. Hunter, and . Thilikos, Lifosearch: A min-max theorem and a searching game for cycle-rank and tree-depth, Discrete Applied Mathematics, vol.160, issue.15, pp.2089-2097, 2012.

V. Andrew, R. E. Goldberg, and . Tarjan, A new approach to the maximumflow problem, Journal of the ACM (JACM), vol.35, issue.4, pp.921-940, 1988.

M. Habib, C. Fabien-de-montgolfier, and . Paul, A simple lineartime modular decomposition algorithm for graphs, using order extension, SWAT, 9th Scandinavian Workshop on Algorithm Theory, pp.187-198, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00159601

M. Habib, R. M. Mcconnell, C. Paul, and L. Viennot, Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing, Theor. Comput. Sci, vol.234, issue.1-2, pp.59-84, 2000.

M. Habib and C. Paul, A survey of the algorithmic aspects of modular decomposition, Computer Science Review, vol.4, issue.1, pp.41-59, 2010.

B. Heeringa, L. Marius-catalin-iordan, and . Theran, Searching in dynamic tree-like partial orders, Algorithms and Data Structures -12th International Symposium, pp.512-523, 2011.

W. Hsu, Decomposition of perfect graphs, Journal of Combinatorial Theory, Series B, vol.43, issue.1, pp.70-94, 1987.

V. Ananth, H. D. Iyer, G. Ratliff, and . Vijayan, Optimal node ranking of trees, Inf. Process. Lett, vol.28, issue.5, pp.225-229, 1988.

V. Ananth, H. D. Iyer, G. Ratliff, and . Vijayan, Parallel assembly of modular products -an analysis, 1988.

L. O. James, R. G. Stanton, and D. D. Cowan, Graph decomposition for undirected graphs, Proc. 3rd Southeastern International Conference on Combinatorics, Graph Theory, and Computing, pp.281-290, 1972.

M. Richard, R. Karp, and . Kleinberg, Noisy binary search and its applications, Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.881-890, 2007.

M. Katchalski, W. Mccuaig, and S. M. Seager, Ordered colourings. Discrete Mathematics, vol.142, issue.1-3, pp.141-154, 1995.

I. Koutis, L. Gary, R. Miller, and . Peng, A nearly-m log n time solver for sdd linear systems, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, pp.590-598, 2011.

E. Sany-laber, R. Luiz-milidiú, and A. A. Pessoa, On binary searching with nonuniform costs, SIAM J. Comput, vol.31, issue.4, pp.1022-1047, 2002.

E. Sany-laber and M. Molinaro, An approximation algorithm for binary searching in trees, Algorithmica, vol.59, issue.4, pp.601-620, 2011.

E. Sany-laber and L. Nogueira, Fast searching in trees, Electronic Notes in Discrete Mathematics, vol.7, pp.90-93, 2001.

E. Sany-laber and L. Nogueira, On the hardness of the minimum height decision tree problem, Discrete Applied Mathematics, vol.144, issue.1-2, pp.209-212, 2004.

W. Tak, F. Lam, and . Ling-yue, Optimal edge ranking of trees in linear time, Algorithmica, vol.30, issue.1, pp.12-33, 2001.

S. Yin-tat-lee, N. Rao, and . Srivastava, A new approach to computing maximum flows using electrical flows, Proceedings of the forty-fifth annual ACM symposium on Theory of computing, pp.755-764, 2013.

A. David, Y. Levin, and . Peres, Markov chains and mixing times, vol.107, 2017.

N. Linial, Locality in distributed graph algorithms, SIAM Journal on Computing, vol.21, issue.1, pp.193-201, 1992.

N. Linial and M. E. Saks, Searching ordered structures, J. Algorithms, vol.6, issue.1, pp.86-103, 1985.

W. H. Joseph and . Liu, Computational models and task scheduling for parallel sparse cholesky factorization, Parallel Computing, vol.3, issue.4, pp.327-342, 1986.

W. H. Joseph and . Liu, The role of elimination trees in sparse factorization, SIAM. J. Matrix Anal. & Appl, vol.11, issue.1, pp.134-172, 1990.

L. Lovász, Random walks on graphs: A survey, Combinatorics, Paul erdos is eighty, vol.2, issue.1, pp.1-46, 1993.

A. Madry, Computing maximum flow with augmenting electrical flows, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS), pp.593-602, 2016.

R. M. Mcconnell, A certifying algorithm for the consecutive-ones property, SODA, Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.768-777, 2004.

M. Ross, F. Mcconnell, and . De-montgolfier, Linear-time modular decomposition of directed graphs, Discrete Applied Mathematics, vol.145, issue.2, pp.198-209, 2005.

A. M. Moshi, Matching cutsets in graphs, Journal of Graph Theory, vol.13, issue.5, pp.527-536, 1989.

S. Mozes, K. Onak, and O. Weimann, Finding an optimal tree searching strategy in linear time, Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.1096-1105, 2008.

R. H. Möèring and F. J. Radermacher, Substitution decomposition for discrete structures and connections with combinatorial optimization, Proceedings of the Workshop on Algebraic Structures in Operations Research, pp.257-355, 1984.

R. H. Möèring, Algorithmic aspects of the substitution decomposition in optimization over relations, set systems and boolean functions, Annals of Operation Research, vol.4, pp.195-225, 1985.

J. Nesetril and P. Mendez, Tree-depth, subgraph coloring and homomorphism bounds, Eur. J. Comb, vol.27, issue.6, pp.1022-1041, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00023821

K. Onak and P. Parys, Generalization of binary search: Searching in trees and forest-like partial orders, 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), pp.379-388, 2006.

D. Peleg, Distributed Computing: A Locality-sensitive Approach, Society for Industrial and Applied Mathematics, 2000.

A. Pothen, The complexity of optimal elimination trees, 1988.

R. L. Rivest, A. R. Meyer, D. J. Kleitman, K. Winklmann, and J. Spencer, Coping with errors in binary search procedures, J. Comput. Syst. Sci, vol.20, issue.3, pp.396-404, 1980.

I. Rusu and J. Spinrad, Forbidden subgraph decomposition. Discrete mathematics, vol.247, pp.159-168, 2002.
URL : https://hal.archives-ouvertes.fr/hal-00442415

A. A. Schäffer, Optimal node ranking of trees in linear time, Inf. Process. Lett, vol.33, issue.2, pp.91-96, 1989.

A. Schrijver, Combinatorial optimization: polyhedra and efficiency, 2003.

P. Serafino, Speeding up graph clustering via modular decomposition based compression, Proceedings of the 28th Annual ACM Symposium on Applied Computing, SAC '13, pp.156-163, 2013.

A. Daniel, S. Spielman, and . Teng, Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems, Proceedings of the STOC, vol.4, 2004.

G. Steiner, Searching in 2-dimensional partial orders, J. Algorithms, vol.8, issue.1, pp.95-105, 1987.

J. L. Szwarcfiter, G. Navarro, R. A. Baeza-yates, J. De, S. Oliveira et al., Optimal binary search trees with costs depending on the access paths, Theor. Comput. Sci, vol.290, issue.3, pp.1799-1814, 2003.

M. Tedder, D. G. Corneil, M. Habib, and C. Paul, Simpler linear-time modular decomposition via recursive factorizing permutations, Automata, Languages and Programming, 35th International Colloquium, ICALP, pp.634-645, 2008.

P. David, D. B. Williamson, and . Shmoys, The design of approximation algorithms, 2011.