L. Alonso, E. Reingold, and R. Schott, Multidimensional Divide-and-Conquer Maximin Recurrences, SIAM Journal on Discrete Mathematics, vol.8, issue.3, pp.428-447, 1995.
DOI : 10.1137/S0895480192232862
URL : https://hal.archives-ouvertes.fr/inria-00076938

M. Béal, A. Bergeron, S. Corteel, and M. Raffinot, An algorithmic view of gene teams, Theoretical Computer Science, vol.320, issue.2-3, pp.395-418, 2004.
DOI : 10.1016/j.tcs.2004.02.036

S. Bérard, A. Bergeron, and C. Chauve, Conservation of Combinatorial Structures in Evolution Scenarios, 8th Annual International Conference on Computational Molecular Biology, pp.1-14, 2004.
DOI : 10.1007/978-3-540-32290-0_1

A. Bergeron, C. Chauve, F. De-montgolfier, and M. Raffinot, Permutations, with Applications to Modular Decomposition of Graphs, 13th Annual European Symposium on Algorithms (ESA'05), pp.779-790, 2005.
DOI : 10.1137/060651331
URL : https://hal.archives-ouvertes.fr/hal-00159580

A. Bergeron and J. Stoye, On the Similarity of Sets of Permutations and its Applications to Genome Comparison, 9th Annual International Conference on Computing and Combinatorics (COCOON'03), volume 2697 of LNCS, pp.68-79, 2003.

A. Bernáth, A note on the directed source location algorithm, Egerváry Research Group, 2004.

M. Blum, R. Floyd, V. Pratt, R. Rivest, and R. Tarjan, Time bounds for selection, Journal of Computer and System Sciences, vol.7, issue.4, pp.36-44, 1973.
DOI : 10.1016/S0022-0000(73)80033-9
URL : http://doi.org/10.1016/s0022-0000(73)80033-9

H. Bodlaender, Treewidth: Characterizations, Applications, and Computations, 32nd International Workshop on Graph-Theoretic Concepts in Computer Science, pp.1-14, 2006.
DOI : 10.1007/11917496_1
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.66.9552

K. Bogart, P. Fishburn, G. Isaak, and L. Langley, Proper and unit tolerance graphs, Discrete Applied Mathematics, vol.60, issue.1-3, pp.99-117, 1995.
DOI : 10.1016/0166-218X(94)00044-E
URL : http://doi.org/10.1016/0166-218x(94)00044-e

R. Borie, R. Parker, and C. Tovey, Solving problems on recursively constructed graphs, ACM Computing Surveys, vol.41, issue.1
DOI : 10.1145/1456650.1456654

C. Bornstein, C. M. De-figueiredo, and V. G. De-sá, The Pair Completion algorithm for the Homogeneous Set Sandwich Problem, Information Processing Letters, vol.98, issue.3, pp.87-91, 2006.
DOI : 10.1016/j.ipl.2005.12.010

V. Bouchitté and I. Todinca, Treewidth and Minimum Fill-in: Grouping the Minimal Separators, SIAM Journal on Computing, vol.31, issue.1, pp.212-232, 2001.
DOI : 10.1137/S0097539799359683

F. Boyer, A. Morgat, L. Labarre, J. Pothier, and A. Viari, Syntons, metabolons and interactons: an exact graph-theoretical approach for exploring neighbourhood between genomic and functional data, Bioinformatics, vol.21, issue.23, pp.4209-4215, 2005.
DOI : 10.1093/bioinformatics/bti711
URL : http://bioinformatics.oxfordjournals.org/cgi/content/short/21/23/4209

B. Bui-xuan, A. Ferreira, and A. Jarry, COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS, International Journal of Foundations of Computer Science, vol.14, issue.02, pp.267-285, 2003.
DOI : 10.1142/S0129054103001728
URL : https://hal.archives-ouvertes.fr/inria-00071996

B. Bui-xuan and M. Habib, A Representation Theorem for Union-Difference Families and Application, 8th Latin American Theoretical Informatics, pp.492-503, 2008.
DOI : 10.1007/978-3-540-78773-0_43
URL : https://hal.archives-ouvertes.fr/lirmm-00175766

B. Bui-xuan, M. Habib, V. Limouzy, and F. De-montgolfier, Algorithmic aspects of a general modular decomposition theory, Discrete Applied Mathematics: special issue of the 3rd conference on Optimal Discrete Structures and Algorithms (ODSA'06)
DOI : 10.1016/j.dam.2008.11.001
URL : https://hal.archives-ouvertes.fr/hal-00111235

B. Bui-xuan, M. Habib, V. Limouzy, and F. De-montgolfier, Homogeneity vs Adjacency: generalising some graph decomposition algorithms, 32nd International Workshop on Graph-Theoretic Concepts in Computer Science (WG'06), pp.278-288, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00020188

B. Bui-xuan, M. Habib, V. Limouzy, and F. De-montgolfier, Unifying Two Graph Decompositions with Modular Decomposition, 18th Annual International Symposium on Algorithms and Computation (ISAAC'07), pp.52-64, 2007.
DOI : 10.1007/978-3-540-77120-3_7
URL : https://hal.archives-ouvertes.fr/hal-00022957

B. Bui-xuan, M. Habib, and C. Paul, Revisiting T. Uno and M. Yagiura's Algorithm, 16th Annual International Symposium of Algorithms and Computation
URL : https://hal.archives-ouvertes.fr/lirmm-00106693

B. Bui-xuan, M. Habib, and C. Paul, Competitive graph searches, Theoretical Computer Science, vol.393, issue.1-3, pp.72-80, 2008.
DOI : 10.1016/j.tcs.2007.10.048
URL : https://hal.archives-ouvertes.fr/lirmm-00132103

B. Bui-xuan, M. Habib, and M. Rao, Representation Theorems for two Set Families and Applications to Combinatorial Decompositions, Extended abstract in Proceedings of the International Conference on Relations, Orders and Graphs: Interaction with Computer Science (ROGICS'08), Nouha editions, pp.532-546, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00555315

B. Bui-xuan and J. A. Telle, H-join and dynamic programming on graphs of bounded rankwidth. Abstract presented in the Workshop on Graph Decomposition: Theoretical, Algorithmic and Logical Aspects, 2008.

C. Capelle, Block decomposition of inheritance hierarchies, 23rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG'97, pp.118-131, 1997.
DOI : 10.1007/BFb0024493

C. Capelle, Décomposition de Graphes et Permutations Factorisantes, 1997.

C. Capelle, M. Habib, and F. De-montgolfier, Graph decompositions and factorizing permutations, Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems, pp.55-70, 2002.
DOI : 10.1109/ISTCS.1997.595165
URL : https://hal.archives-ouvertes.fr/hal-00958972

M. Cerioli, H. Everett, C. M. De-figueiredo, and S. Klein, The homogeneous set sandwich problem, Information Processing Letters, vol.67, issue.1, pp.31-35, 1998.
DOI : 10.1016/S0020-0190(98)00076-3

M. Chein, M. Habib, and M. Maurer, Partitive hypergraphs, Discrete Mathematics, vol.37, issue.1, pp.35-50, 1981.
DOI : 10.1016/0012-365X(81)90138-2
URL : http://doi.org/10.1016/0012-365x(81)90138-2

D. Cohen, M. Cooper, and P. Jeavons, Generalising submodularity and horn clauses: Tractable optimization problems defined by tournament pair multimorphisms, Theoretical Computer Science, vol.401, issue.1-3, 2006.
DOI : 10.1016/j.tcs.2008.03.015
URL : http://doi.org/10.1016/j.tcs.2008.03.015

T. Cormen, C. Leiserson, and R. Rivest, Introduction to Algorithms, 1990.

D. Corneil and U. Rotics, On the Relationship Between Clique-Width and Treewidth, SIAM Journal on Computing, vol.34, issue.4, pp.825-847, 2005.
DOI : 10.1137/S0097539701385351

F. Coulon and M. Raffinot, Identification of maximal common connected sets of interval graphs and tree forests, 1st International Conference on Algorithms and Computational Methods for Biochemical and Evolutionary Networks (Comp- BioNets'04), 2004.

F. Coulon and M. Raffinot, Fast algorithms for identifying maximal common connected sets of interval graphs, Discrete Applied Mathematics, vol.154, issue.12, pp.1709-1721, 2006.
DOI : 10.1016/j.dam.2006.02.005

B. Courcelle, J. Engelfriet, and G. Rozenberg, Handle-rewriting hypergraph grammars, Journal of Computer and System Sciences, vol.46, issue.2, pp.218-270, 1993.
DOI : 10.1016/0022-0000(93)90004-G
URL : http://doi.org/10.1016/0022-0000(93)90004-g

B. Courcelle and M. Kanté, Graph Operations Characterizing Rank-Width and Balanced Graph Expressions, 33rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG'07), pp.66-75, 2007.
DOI : 10.1007/978-3-540-74839-7_7
URL : https://hal.archives-ouvertes.fr/hal-00306343

B. Courcelle, J. Makowsky, and U. Rotics, Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width. Theory of Computing Systems, pp.125-150, 2000.

B. Courcelle and S. Oum, Vertex-minors, monadic second-order logic, and a conjecture by Seese, Journal of Combinatorial Theory, Series B, vol.97, issue.1, pp.91-126, 2007.
DOI : 10.1016/j.jctb.2006.04.003
URL : https://hal.archives-ouvertes.fr/hal-00334147

A. Cournier and M. Habib, A new linear algorithm for Modular Decomposition, Trees in algebra and programming (CAAP'94), 1994.
DOI : 10.1007/BFb0017474

C. Crespelle, Représentation dynamiques de graphes, 2007.

W. Cunningham, A combinatorial decomposition theory, Journal canadien de math??matiques, vol.32, issue.3, 1973.
DOI : 10.4153/CJM-1980-057-7

W. Cunningham, Decomposition of submodular functions, Combinatorica, vol.18, issue.1, pp.53-68, 1983.
DOI : 10.1007/BF02579341

W. Cunningham and J. Edmonds, A combinatorial decomposition theory, Journal canadien de math??matiques, vol.32, issue.3, pp.734-765, 1980.
DOI : 10.4153/CJM-1980-057-7

E. Dahlhaus, Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition, Journal of Algorithms, vol.36, issue.2, pp.205-240, 2000.
DOI : 10.1006/jagm.2000.1090

E. Dahlhaus, J. Gustedt, and R. Mcconnell, Efficient and Practical Algorithms for Sequential Modular Decomposition, Journal of Algorithms, vol.41, issue.2, pp.360-387, 2001.
DOI : 10.1006/jagm.2001.1185
URL : https://hal.archives-ouvertes.fr/inria-00072855

M. De-berg, M. Van-kreveld, M. Overmars, and O. Schwarzkopf, Computational geometry, 1991.

E. Dinitz, A. Karzanov, and M. Lomonosov, On the structure of a family of minimal weighted cuts in a graph, Studies in Discrete Optimization, pp.290-306, 1976.

J. Edmonds and R. Giles, A Min-Max Relation for Submodular Functions on Graphs, Annals of Discrete Mathematics, vol.1, pp.185-204, 1977.
DOI : 10.1016/S0167-5060(08)70734-9

A. Ehrenfeucht, T. Harju, and G. Rozenberg, The Theory of 2-Structures -A Framework for Decomposition and Transformation of Graphs, World Scientific, 1999.

A. Ehrenfeucht and G. Rozenberg, Theory of 2-structures, Theoretical Computer Science, vol.3, issue.70, pp.277-342, 1990.

D. Eppstein, G. Italiano, R. Tamassia, R. Tarjan, J. Westbrook et al., Maintenance of a minimum spanning forest in a dynamic plane graph, Journal of Algorithms, vol.13, issue.1, pp.33-54, 1992.
DOI : 10.1016/0196-6774(92)90004-V

M. Everett and S. Borgatti, Regular equivalence: General theory, The Journal of Mathematical Sociology, vol.12, issue.1, pp.29-52, 1994.
DOI : 10.1016/0378-8733(88)90013-5

S. Felsner, Tolerance graphs, and orders, Journal of Graph Theory, vol.28, issue.3, pp.129-140, 1998.
DOI : 10.1002/(SICI)1097-0118(199807)28:3<129::AID-JGT2>3.0.CO;2-M
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.30.4913

J. Fiala and D. Paulusma, A complete complexity classification of the role assignment problem, Theoretical Computer Science, vol.349, issue.1, pp.67-81, 2005.
DOI : 10.1016/j.tcs.2005.09.029

M. Figeac and J. Varré, Sorting by Reversals with Common Intervals, 4th International Workshop on Algorithms in Bioinformatics, pp.26-37, 2004.
DOI : 10.1007/978-3-540-30219-3_3

T. Fleiner and T. Jordán, Coverings and structure of crossing families, Mathematical Programming, pp.505-518, 1999.
DOI : 10.1007/s101070050035

J. Fouquet, M. Habib, F. De-montgolfier, and J. Vanherpe, Bimodular Decomposition of Bipartite Graphs, 30th International Workshop on Graph-Theoretic Bibliography Concepts in Computer Science, pp.117-128, 2004.
DOI : 10.1007/978-3-540-30559-0_10
URL : https://hal.archives-ouvertes.fr/lirmm-00108942

S. Fujishige, Canonical decompositions of symmetric submodular systems, Graph Theory and Algorithms, pp.53-64, 1981.

S. Fujishige, Structures of polyhedra determined by submodular functions on crossing families, Mathematical Programming, vol.4, issue.2, pp.125-141, 1984.
DOI : 10.1007/BF02592217

H. Gabow, Centroids, Representations, and Submodular Flows, Journal of Algorithms, vol.18, issue.3, pp.586-628, 1995.
DOI : 10.1006/jagm.1995.1022

J. Gagneur, R. Krause, T. Bouwmeester, and G. Casari, Modular decomposition of protein-protein interaction networks, Genome Biology, vol.5, issue.8, 2004.

A. Gai, Algorithmes de Partitionnement: Minimisation d'Automates et Applications aux Graphes, 2003.

A. Gai, M. Habib, C. Paul, and M. Raffinot, Identifying Common Connected Components of Graphs, 2003.
URL : https://hal.archives-ouvertes.fr/lirmm-00269551

T. Gallai, Transitiv orientierbare Graphen, Acta Mathematica Academiae Scientiarum Hungaricae, vol.51, issue.1-2, pp.25-66, 1967.
DOI : 10.1007/BF02020961

M. Golumbic, H. Kaplan, and R. Shamir, Graph Sandwich Problems, Journal of Algorithms, vol.19, issue.3, pp.449-473, 1995.
DOI : 10.1006/jagm.1995.1047
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.8158

M. Habib, F. De-montgolfier, and C. Paul, A simple linear-time modular decomposition algorithm, 9th Scandinavian Workshop on Algorithm Theory, pp.187-198, 2004.
URL : https://hal.archives-ouvertes.fr/lirmm-00108788

M. Habib, M. Huchard, and J. Spinrad, A linear algorithm to decompose inheritance graphs into modules, Algorithmica, vol.11, issue.6, pp.573-591, 1995.
DOI : 10.1007/BF01189070

M. Habib, C. Paul, and M. Raffinot, Common connected Components of Interval Graphs, 15th Annual Symposium on Combinatorial Pattern Matching, pp.347-358, 2004.
URL : https://hal.archives-ouvertes.fr/lirmm-00269548

M. Habib, C. Paul, and L. Viennot, PARTITION REFINEMENT TECHNIQUES: AN INTERESTING ALGORITHMIC TOOL KIT, International Journal of Foundations of Computer Science, vol.10, issue.02, pp.147-170, 1999.
DOI : 10.1142/S0129054199000125

S. Heber and J. Stoye, Finding All Common Intervals of k Permutations, 12th Annual Symposium on Combinatorial Pattern Matching (CPM'01), pp.207-218, 2001.
DOI : 10.1007/3-540-48194-X_19

M. Henzinger and V. King, Randomized dynamic graph algorithms with polylogarithmic time per operation, 27th Annual ACM Symposium on Theory of Computing (STOC'95), pp.519-527, 1995.
DOI : 10.1145/225058.225269
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.17.4547

P. Hlin?n´hlin?n´y and S. Oum, Finding Branch-Decompositions and Rank-Decompositions

P. Hlin?n´hlin?n´y, S. Oum, D. Seese, and G. Gottlob, Width Parameters Beyond Tree-width and their Applications, The Computer Journal, vol.51, issue.3, pp.326-362, 2008.
DOI : 10.1093/comjnl/bxm052

J. Holm, K. De-lichtenberg, and M. Thorup, Poly-logarithmic deterministic fullydynamic algorithms for connectivity, minimum spanning tree, 2?edge, and biconnectivity, 30th Annual ACM Symposium on Theory of Computing (STOC'98), pp.79-89, 1998.

W. Hsu and T. Ma, Substitution decomposition on chordal graphs and applications, 2nd International Symposium on Algorithms (ISA'91), pp.52-60, 1991.
DOI : 10.1007/3-540-54945-5_49

W. Hsu and R. Mcconnell, PC trees and circular-ones arrangements, Theoretical Computer Science, vol.296, issue.1, pp.99-116, 2003.
DOI : 10.1016/S0304-3975(02)00435-8
URL : http://doi.org/10.1016/s0304-3975(02)00435-8

M. Huchard, Sur quelques questions algorithmiques de l'héritage multiple, 1992.

J. Johnson, Polynomial time recognition and optimization algorithms on special classes of graphs, 2003.

T. Király, Edge-connectivity of undirected and directed hypergraphs, 2003.

G. Landau, L. Parida, and O. Weimann, Using PQ Trees for Comparative Genomics, 16th Annual Symposium on Combinatorial Pattern Matching (CPM'05), 2005.
DOI : 10.1007/11496656_12

J. Lanlignel, Autour de la décomposition en coupes, 2001.

Z. Li and E. Reingold, Solution of a Divide-and-Conquer Maximin Recurrence, SIAM Journal on Computing, vol.18, issue.6, pp.1188-1200, 1989.
DOI : 10.1137/0218079

V. Limouzy, Thesis in preparation

R. Lipton and R. Tarjan, Applications of a Planar Separator Theorem, SIAM Journal on Computing, vol.9, issue.3, pp.615-627, 1980.
DOI : 10.1137/0209046

F. Maffray and M. Preissmann, A translation of Tibor Gallai's paper: Transitiv orientierbare Graphen, Perfect Graphs, pp.25-66, 2001.

R. Mcconnell and F. De-montgolfier, Algebraic Operations on PQ Trees and Modular Decomposition Trees, 31st International Workshop on Graph-Theoretic Concepts in Computer Science (WG'05), pp.421-432, 2005.
DOI : 10.1007/11604686_37
URL : https://hal.archives-ouvertes.fr/hal-00159590

R. Mcconnell and F. De-montgolfier, Linear-time modular decomposition of directed graphs, Discrete Applied Mathematics, vol.145, issue.2, pp.189-209, 2005.
DOI : 10.1016/j.dam.2004.02.017
URL : https://hal.archives-ouvertes.fr/hal-00159571

R. Mcconnell and J. Spinrad, Linear-time modular decomposition and efficient transitive orientation of comparability graphs, 5th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'94), pp.536-545, 1994.

R. Mcconnell and J. Spinrad, Modular decomposition and transitive orientation, Discrete Mathematics, vol.201, issue.1-3, pp.189-241, 1999.
DOI : 10.1016/S0012-365X(98)00319-7

K. Mehlhorn, Data Structures and Efficient Algorithms, EATCS Monographs, 1984.

R. Möhring, Algorithmic aspects of the substitution decomposition in optimization over relations, set systems and Boolean functions, Annals of Operations Research, vol.69, issue.1, pp.195-225, 1985.
DOI : 10.1007/BF02022041

R. Möhring and F. Radermacher, Substitution Decomposition for Discrete Structures and Connections with Combinatorial Optimization, Annals of Discrete Mathematics, vol.19, pp.257-356, 1984.
DOI : 10.1016/S0304-0208(08)72966-9

F. De-mongolfier and M. Rao, The bi-join decomposition, Electronic Notes in Discrete Mathematics, vol.22, 2005.
DOI : 10.1016/j.endm.2005.06.039

F. De-montgolfier, Décomposition modulaire des graphes. Théorie, extensions et algorithmes, 2003.

S. Nikolopoulos and L. Palios, Minimal separators in <mml:math altimg="si8.gif" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:msub></mml:math>-sparse graphs, Discrete Mathematics, vol.306, issue.3, pp.381-392, 2006.
DOI : 10.1016/j.disc.2005.12.008

S. Oum, Graphs of Bounded Rank-width, 2005.

S. Oum, Rank-width and vertex-minors, Journal of Combinatorial Theory, Series B, vol.95, issue.1, pp.79-100, 2005.
DOI : 10.1016/j.jctb.2005.03.003
URL : http://doi.org/10.1016/j.jctb.2005.03.003

S. Oum, Rank-Width and Well-Quasi-Ordering, SIAM Journal on Discrete Mathematics, vol.22, issue.2, pp.666-682, 2008.
DOI : 10.1137/050629616
URL : http://koasas.kaist.ac.kr/bitstream/10203/5249/1/wqo-final.pdf

S. Oum, Rank-width is less than or equal to branch-width, Journal of Graph Theory, vol.52, issue.3, pp.239-244, 2008.
DOI : 10.1002/jgt.20280

S. Oum and P. Seymour, Approximating clique-width and branch-width, Journal of Combinatorial Theory, Series B, vol.96, issue.4, pp.514-528, 2006.
DOI : 10.1016/j.jctb.2005.10.006

C. Paul, Aspects algorithmiques de la décomposition modulaire, 2006.

E. Prisner, Bicliques in Graphs I: Bounds on Their Number, Combinatorica, vol.20, issue.1, pp.109-117, 2000.
DOI : 10.1007/s004930070035

M. Rao, Décomposition de graphes et algorithmes efficaces, 2006.

N. Robertson and P. Seymour, Graph minors. X. Obstructions to tree-decomposition, Journal of Combinatorial Theory, Series B, vol.52, issue.2, pp.153-190, 1991.
DOI : 10.1016/0095-8956(91)90061-N

A. Schrijver, Proving total dual integrality with cross-free families???A general framework, Mathematical Programming, vol.16, issue.2, pp.15-27, 1984.
DOI : 10.1007/BF02591726

A. Schrijver, Combinatorial Optimization -Polyhedra and Efficiency, 2003.

D. Seinsche, On a property of the class of n-colorable graphs, Journal of Combinatorial Theory, Series B, vol.16, issue.2, pp.191-193, 1974.
DOI : 10.1016/0095-8956(74)90063-X

M. Tedder, D. Corneil, M. Habib, and C. Paul, Simple, Linear-Time Modular Decomposition, 35th International Colloquium on Automata, Languages and Programming, pp.634-645, 2008.
URL : https://hal.archives-ouvertes.fr/lirmm-00324557

I. Todinca, Aspects algorithmiques des triangulations minimales des graphes, 1999.

I. Todinca, Décompositions arborescentes de graphes : calcul, approximations, heuristiques, 2006.

T. Uno and M. Yagiura, Fast Algorithms to Enumerate All Common Intervals of Two Permutations, Algorithmica, vol.26, issue.2, pp.290-309, 2000.
DOI : 10.1007/s004539910014

E. Wanke, k-NLC graphs and polynomial algorithms, Discrete Applied Mathematics, vol.54, issue.2-3, pp.251-266, 1994.
DOI : 10.1016/0166-218X(94)90026-4
URL : http://doi.org/10.1016/0166-218x(94)90026-4

D. White and K. Reitz, Graph and semigroup homomorphisms on networks of relations, Social Networks, vol.5, issue.2, pp.193-234, 1983.
DOI : 10.1016/0378-8733(83)90025-4

. Du-graphe-de-départ, une clique maximum d'un graphe quelconque, d'abord en utilisant la décomposition en H-joints, puis en utilisant son cas particulier d'une décomposition par largeur de rang. A l'instar des cas de la décomposition arborescente et du tri-fusion, l'´ etape de division de notre méthode est simple tandis que celle d'unification consitue le coeur de l'algorithme. Nos activités jusqu'` a ce jour ont amenéamenéà des références] (détails ci-dessous) Dans ce manuscrit, nous développons 18] sans rentrer dans les détails. Nous n'´ evoquons pas [14] dans ce manuscrit, La plupart des idées présentées dans le Chapitre 1, l'approche alternative présentée dans le Chapitre 2 pour représenter les familles partitives, deux schémas de décomposition de ceux présentésprésentésà la fin du Chapitre 2, ainsi que tous les résultats présentés dans le Chapitre 3, sont basés sur, p.17, 2019.

B. Bui-xuan, M. Habib, and C. Paul, Revisiting T. Uno and M. Yagiura's Algorithm, 16th Annual International Symposium on Algorithms and Computation (ISAAC'05), pp.146-155, 2005.
URL : https://hal.archives-ouvertes.fr/lirmm-00106693

B. Bui-xuan, M. Habib, and M. Rao, Representation Theorems for two Set Families and Applications to Combinatorial Decompositions, Extended abstract in Proceedings of the International Conference on Relations, Orders and Graphs: Interaction with Computer Science (ROGICS'08), Nouha editions, pp.532-546, 2008.
DOI : 10.1016/j.ejc.2011.09.032
URL : https://hal.archives-ouvertes.fr/hal-00555315