, Compute a maximum matching for

, Compute a maximum matching for

, M , then discard M ? {v}. Otherwise, discard M

, We do so only if M satisfies some properties, SPLIT and MATCH" [101] to some module M and its neighbourhood N G (M )

, We introduce the reduction rules below and we prove their correctness. Reduction rules. The following lemma generalizes a well-known reduction rule for Maximum Matching: add a pending vertex and its unique neighbour to the matching then remove this edge, vol.78

, Lemma 19. Let M be a module in a graph G = (V, E) such that N G (M ) = {v}, F M is a maximum matching of G[M ] and F * M is obtained from F M by adding an edge between v and any unmatched vertex of M (possibly, F * M = F M if it is a perfect matching

G. and (. E-\-e-;-?-f-m, It implies that a maximum matching F of G \ (u, v) is the union of any maximum matching of G[M \ u] with any maximum matching of G, Suppose there exists u ? M \ V (F M ). Then, u is a pending vertex of G M . There exists a maximum matching of G M

, v k?1 ) are vertices of G. In this situation, since N G (v 1 subgraph, with v 3 being its unique neighbour. Furthermore, by Lemma 19 we can compute a maximum matching of G[S] from F Mv x , by adding an edge between v 2 (if it is present) and an unmatched vertex in M x (if any). So, we again apply the reduction rule of Lemma 19, this time to S. Doing so, we discard S, and possibly v 3 . Then, by a symmetrical argument we can also discard M v k , M y , v k?1 and possibly v k?2 . We are left with computing a maximum matching for some subpath of

?. In-particular,-f-*-=-f-mv-;-?-f-mv-k-?-f-mx, M. My-;-?-m-v-k-?-m-x-?-m-y-;-,-m-v-k-,-m-x, and . Sequentially, For every M we try to apply the SPLIT and MATCH technique of Definition 2. Overall, we claim that the above procedure can be implemented to run in constant time per loop. Indeed, assume that the matched vertices (resp., the unmatched vertices) are stored in a list in such a way that all the vertices in a same module M v , v ? V (G ) are consecutive. For every matched vertex u, we can access to the vertex that is matched with u in constant time. Furthermore for every v ? V (G ), we keep a pointer to the first and last vertices of M v in the list of matched vertices (resp., in the list of unmatched vertices). For any loop of the procedure, we iterate over four modules M , that is a constant. Furthermore, since |N G (M )| ? |V (G) \ M | ? 2 then we only need to check three unmatched vertices of V \ M in order to decide whether we can perform a MATCH operation. Note that we can skip scanning the unmatched vertices in M using our pointer structure, so, Case G is a spiked p-chain P k . By Theorem 24, the nontrivial modules of M(G) can only be M v 1

\. Let and P. , V (F k?2 ) ? V (F max ) by construction and v k/2 (the only vertex of P k?2 possibly unmatched) is adjacent to every vertex of U . Therefore, if the subclaim were false then u 1 , u 2 should be adjacent, hence they should have been matched together with a MATCH operation, Let F max be the matching so obtained. By the above claim it takes O(|F max | ? |F 0 |)-time to compute it with the above procedure. Furthermore, we claim that F max is maximum, vol.13

. V-(f-*-)-?-v-(f-max, we should have increased the matching with a SPLIT operation

, By Theorem 24, v 2i ? V (G), hence M v 2i?1 is a pending module of G i . Thus, we can apply the reduction rule of Lemma 19. Doing so, we can discard the set S i , where S i = M v 2i?1 ? {v 2i } if F Mv 2i?1 is not a perfect matching of G, Case G is a spiked p-chain Q k . For every 1 ? i ? k/2 , let V i = j?i (M v 2j, with v 2i being its unique neighbour

, Then, there are two subcases. If v 2i ? S i then M z 2i?1 is disconnected in G

A. Abboud, F. Grandoni, and V. Williams, We apply the reduction rule of Lemma 19. Doing so, we can discard the set T i , where References, M z 2i?1 is a pending module of G[V i \ S i ] with v 2i being its unique neighbour, pp.1681-1697

A. Abboud, V. , and V. Williams, Popular conjectures imply strong lower bounds for dynamic problems, IEEE Symposium on Foundations of Computer Science (FOCS), pp.434-443, 2014.

A. Abboud, V. Williams, and J. R. Wang, Approximation and fixed parameter subquadratic algorithms for radius and diameter in sparse graphs, ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.377-391, 2016.

M. Aigner and M. Fromme, A game of cops and robbers, Discrete Applied Mathematics, vol.8, issue.1, pp.1-12, 1984.

L. Babel, Tree-like P 4 -connected graphs, Discrete Mathematics, vol.191, issue.1-3, pp.13-23, 1998.

L. Babel, Recognition and isomorphism of tree-like P 4 -connected graphs, Discrete Applied Mathematics, vol.99, issue.1, pp.295-315, 2000.

L. Babel and S. Olariu, On the structure of graphs with few P 4 's. Discrete Applied Mathematics, vol.84, pp.1-13, 1998.

L. Babel and S. Olariu, On the p-connectedness of graphs -a survey, Discrete Applied Mathematics, vol.95, issue.1-3, pp.11-33, 1999.

H. Bandelt and H. M. Mulder, Distance-hereditary graphs, Journal of Combinatorial Theory, Series B, vol.41, issue.2, pp.182-208, 1986.

S. Baumann, A linear algorithm for the homogeneous decomposition of graphs, 1996.

M. Bentert, T. Fluschnik, A. Nichterlein, and R. Niedermeier, Parameterized aspects of triangle enumeration, International Symposium on Fundamentals of Computation Theory (FCT), vol.10472, pp.96-110, 2017.

C. Berge, Two theorems in graph theory, Proceedings of the National Academy of Sciences, vol.43, issue.9, pp.842-844, 1957.

H. L. Bodlaender, A partial k-arboretum of graphs with bounded treewidth, Theoretical computer science, vol.209, issue.1, pp.1-45, 1998.

H. L. Bodlaender, Treewidth: Characterizations, Applications, and Computations, International Workshop on Graph-Theoretic Concepts in Computer Science (WG), vol.4271, pp.1-14, 2006.

H. L. Bodlaender and A. M. Koster, Safe separators for treewidth, Discrete Mathematics, vol.306, issue.3, pp.337-350, 2006.

J. A. Bondy and U. S. Murty, Graph theory, Graduate Texts in Mathematics, vol.244, 2008.

M. Borassi, D. Coudert, P. Crescenzi, and A. Marino, On computing the hyperbolicity of real-world graphs, European Symposia on Algorithms (ESA), vol.9294, pp.215-226, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01199860

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

U. Brandes, A faster algorithm for betweenness centrality, The Journal of Mathematical Sociology, vol.25, issue.2, pp.163-177, 2001.

G. Brinkmann, J. H. Koolen, and V. Moulton, On the hyperbolicity of chordal graphs, Annals of Combinatorics, vol.5, issue.1, pp.61-69, 2001.

B. Bui-xuan, J. A. Telle, and M. Vatshelle, Boolean-width of graphs, Theoretical computer science, vol.412, issue.39, pp.5187-5204, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00555494

P. Charbit, F. D. Montgolfier, and M. Raffinot, Linear time split decomposition revisited, SIAM Journal on Discrete Mathematics, vol.26, issue.2, pp.499-514, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00921774

N. Cohen, D. Coudert, G. Ducoffe, and A. Lancin, Applying clique-decomposition for computing gromov hyperbolicity, Theoretical computer science, vol.690, pp.114-139, 2017.
URL : https://hal.archives-ouvertes.fr/hal-00989024

N. Cohen, D. Coudert, and A. Lancin, On computing the gromov hyperbolicity, Journal of Experimental Algorithmics, vol.20, pp.1-6, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01182890

D. G. Corneil, M. Habib, J. Lanlignel, B. Reed, and U. Rotics, Polynomial Time Recognition of Clique-Width ? 3 Graphs, Latin American Theoretical INformatics Symposium (LATIN), vol.1776, pp.126-134, 2000.
URL : https://hal.archives-ouvertes.fr/hal-01274081

D. G. Corneil, Y. Perl, and L. K. Stewart, A linear recognition algorithm for cographs, SIAM Journal on Computing, vol.14, issue.4, pp.926-934, 1985.

D. G. Corneil and U. Rotics, On the relationship between clique-width and treewidth, SIAM Journal on Computing, vol.34, issue.4, pp.825-847, 2005.

D. Coudert and G. Ducoffe, Recognition of C 4 -free and 1/2-hyperbolic graphs, SIAM Journal on Discrete Mathematics, vol.28, issue.3, pp.1601-1617, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01070768

D. Coudert, G. Ducoffe, and A. Popa, Fully polynomial FPT algorithms for some classes of bounded clique-width graphs, ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.2765-2784, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01676187

B. Courcelle, The monadic second-order logic of graphs. I. Recognizable sets of finite graphs. Information and Computation, vol.85, pp.12-75, 1990.
URL : https://hal.archives-ouvertes.fr/hal-00353765

B. Courcelle, On the model-checking of monadic second-order formulas with edge set quantifications, Discrete Applied Mathematics, vol.160, issue.6, pp.866-887, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00481735

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.

B. Courcelle, P. Heggernes, D. Meister, C. Papadopoulos, and U. Rotics, A characterisation of clique-width through nested partitions, Discrete Applied Mathematics, vol.187, pp.70-81, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01022109

B. Courcelle, J. A. Makowsky, and U. Rotics, Linear time solvable optimization problems on graphs of bounded clique-width. Theory of Computing Systems, vol.33, pp.125-150, 2000.

B. Courcelle and S. Olariu, Upper bounds to the clique width of graphs, Discrete Applied Mathematics, vol.101, issue.1, pp.77-114, 2000.

W. H. Cunningham, Decomposition of directed graphs, SIAM Journal on Algebraic Discrete Methods, vol.3, issue.2, pp.214-228, 1982.

R. Diestel, Graph Theory. Graduate Texts in Mathematics, 2010.

R. G. Downey and M. R. Fellows, Parameterized complexity. Monographs in Computer Science, 1999.

F. F. Dragan, On greedy matching ordering and greedy matchable graphs, International Workshop on Graph-Theoretic Concepts in Computer Science (WG), vol.1335, pp.184-198, 1997.

F. F. Dragan and F. Nicolai, LexBFS-orderings of distance-hereditary graphs with application to the diametral pair problem, Discrete Applied Mathematics, vol.98, issue.3, pp.191-207, 2000.

R. Duan and S. Pettie, Linear-time approximation for maximum weight matching, Journal of the ACM, vol.61, issue.1, p.1, 2014.

G. Ducoffe, Metric properties of large graphs, 2016.
URL : https://hal.archives-ouvertes.fr/tel-01485328

G. Ducoffe and A. Popa, The b-matching problem in distance-hereditary graphs and beyond, International Symposium on Algorithms and Computation (ISAAC), vol.123, pp.1-30, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01955994

G. Ducoffe and A. Popa, The use of a pruned modular decomposition for maximum matching algorithms on some graph classes, International Symposium on Algorithms and Computation (ISAAC), vol.123, pp.1-6, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01773568

J. Edmonds, Paths, trees, and flowers, Canadian Journal of Mathematics, vol.17, issue.3, pp.449-467, 1965.

W. Espelage, F. Gurski, and E. Wanke, How to solve NP-hard graph problems on cliquewidth bounded graphs in polynomial time, International Workshop on Graph-Theoretic Concepts in Computer Science (WG), vol.1, pp.117-128, 2001.

J. Evald and S. Dahlgaard, Tight hardness results for distance and centrality problems in constant degree graphs, 2016.

M. R. Fellows, F. A. Rosamond, U. Rotics, and S. Szeider, Clique-width is NP-complete, SIAM Journal on Discrete Mathematics, vol.23, issue.2, pp.909-939, 2009.

T. Fluschnik, C. Komusiewicz, G. B. Mertzios, A. Nichterlein, R. Niedermeier et al., When can graph hyperbolicity be computed in linear time?, Workshop on Algorithms and Data Structures, vol.10389, pp.397-408

. Springer, , 2017.

F. V. Fomin, P. A. Golovach, D. Lokshtanov, and S. Saurabh, Intractability of clique-width parameterizations, SIAM Journal on Computing, vol.39, issue.5, pp.1941-1956, 2010.

F. V. Fomin, P. A. Golovach, D. Lokshtanov, and S. Saurabh, Almost optimal lower bounds for problems parameterized by clique-width, SIAM Journal on Computing, vol.43, issue.5, pp.1541-1563, 2014.

F. V. Fomin, P. A. Golovach, D. Lokshtanov, S. Saurabh, and M. Zehavi, Clique-width III: Hamiltonian Cycle and the Odd Case of Graph Coloring, ACM Transactions on Algorithms, vol.15, issue.1, p.9, 2019.

F. V. Fomin, D. Lokshtanov, S. Saurabh, M. Pilipczuk, and M. Wrochna, Fully polynomialtime parameterized computations for graphs and matrices of low treewidth, ACM Transactions on Algorithms, vol.14, issue.3, 2018.

J. Fouquet, V. Giakoumakis, and J. Vanherpe, Bipartite graphs totally decomposable by canonical decomposition, International Journal of Foundations of Computer Science, vol.10, issue.4, pp.513-533, 1999.
URL : https://hal.archives-ouvertes.fr/hal-00467645

J. Fouquet, I. Parfenoff, and H. Thuillier, An O(n)-time algorithm for maximum matching in P 4 -tidy graphs, Information Processing Letter, vol.62, issue.6, pp.281-287, 1997.

H. Fournier, A. Ismail, and A. Vigneron, Computing the Gromov hyperbolicity of a discrete metric space, Information Processing Letter, vol.115, issue.6, pp.576-579, 2015.

L. C. Freeman, A set of measures of centrality based on betweenness, Sociometry, vol.40, issue.1, pp.35-41, 1977.

H. N. Gabow, An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems, ACM Symposium on the Theory of Computing (STOC), pp.448-456, 1983.

H. N. Gabow and R. E. Tarjan, A linear-time algorithm for a special case of disjoint set union, ACM Symposium on the Theory of Computing (STOC), pp.246-251, 1983.

J. Gajarsk?, M. Lampis, and S. Ordyniak, Parameterized Algorithms for Modular-Width, International Symposium on Parameterized and Exact Computation (IPEC), vol.8246, pp.163-176, 2013.

A. Gajentaan and M. H. Overmars, On a class of (n 2 ) problems in computational geometry, Computational Geometry, vol.5, issue.3, pp.165-185, 1995.

T. Gallai, Transitiv orientierbare graphen, Acta Mathematica Hungarica, vol.18, issue.1, pp.25-66, 1967.

R. Ganian, Thread graphs, linear rank-width and their algorithmic applications, International Workshop on Combinatorial Algorithms (IWOCA), vol.6460, pp.38-42, 2010.
DOI : 10.1007/978-3-642-19222-7_5

C. Gavoille and C. Paul, Distance labeling scheme and split decomposition, Discrete Mathematics, vol.273, issue.1, pp.115-130, 2003.
URL : https://hal.archives-ouvertes.fr/lirmm-00090364

V. Giakoumakis, F. Roussel, and H. Thuillier, On P 4 -tidy graphs, Discrete Mathematics & Theoretical Computer Science, vol.1, issue.1, pp.17-41, 1997.
URL : https://hal.archives-ouvertes.fr/hal-00955688

A. C. Giannopoulou, G. B. Mertzios, and R. Niedermeier, Polynomial fixed-parameter algorithms: A case study for longest path on interval graphs, Theoretical computer science, vol.689, pp.67-95, 2017.

E. Gioan and C. Paul, Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs, Discrete Applied Mathematics, vol.160, issue.6, pp.708-733, 2012.
URL : https://hal.archives-ouvertes.fr/lirmm-00783420

M. C. Golumbic and U. Rotics, On the clique-width of some perfect graph classes, International Journal of Foundations of Computer Science, vol.11, issue.03, pp.423-443, 2000.

M. Gromov, Hyperbolic groups, Essays in group theory, pp.75-263, 1987.

F. Gurski and E. Wanke, The tree-width of clique-width bounded graphs without K n,n, International Workshop on Graph-Theoretic Concepts in Computer Science (WG), vol.1928, pp.196-205, 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.

E. Howorka, On metric properties of certain clique graphs, Journal of Combinatorial Theory, Series B, vol.27, issue.1, pp.67-74, 1979.

T. Husfeldt, Computing graph distances parameterized by treewidth and diameter, International Symposium on Parameterized and Exact Computation (IPEC), vol.63, pp.1-16, 2016.

R. Impagliazzo, R. Paturi, and F. Zane, Which problems have strongly exponential complexity?, IEEE Symposium on Foundations of Computer Science (FOCS), pp.653-663, 1998.

Y. Iwata, T. Ogasawara, and N. Ohsaka, On the power of tree-depth for fully polynomial FPT algorithms, International Symposium on Theoretical Aspects of Computer Science (STACS), vol.96, pp.1-41, 2018.

B. Jamison and S. Olariu, P-components and the homogeneous decomposition of graphs, SIAM Journal on Discrete Mathematics, vol.8, issue.3, pp.448-463, 1995.

C. Jordan, Sur les assemblages de lignes, Journal für die reine und angewandte Mathematik, vol.1869, issue.70, pp.185-190, 1869.

R. M. Karp and M. Sipser, Maximum matching in sparse random graphs, IEEE Symposium on Foundations of Computer Science (FOCS), pp.364-375, 1981.

D. Kratsch and J. P. Spinrad, Between (nm) and (n ? ), SIAM Journal on Computing, vol.36, issue.2, pp.310-325, 2006.

S. Kratsch and F. Nelles, Efficient and adaptive parameterized algorithms on modular decompositions, European Symposia on Algorithms (ESA), vol.55, pp.1-55, 2018.

M. Lampis, Algorithmic meta-theorems for restrictions of treewidth, Algorithmica, vol.64, issue.1, pp.19-37, 2012.

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

J. A. Makowsky and U. Rotics, On the clique-width of graphs with few P 4 's, International Journal of Foundations of Computer Science, vol.10, issue.03, pp.329-348, 1999.

G. B. Mertzios, A. Nichterlein, and R. Niedermeier, The power of linear-time data reduction for maximum matching, International Symposium on Mathematical Foundations of Computer Science (MFCS), vol.83, pp.1-46, 2017.

S. Micali and V. V. Vazirani, An O( ? V E) algorithm for finding maximum matching in general graphs, IEEE Symposium on Foundations of Computer Science (FOCS), pp.17-27, 1980.

M. B. Novick, Fast parallel algorithms for the modular decomposition, 1989.

S. Olariu, Weak bipolarizable graphs. Discrete Mathematics, vol.74, pp.159-171, 1989.

S. Oum and P. D. Seymour, Approximating clique-width and branch-width, Journal of Combinatorial Theory, Series B, vol.96, issue.4, pp.514-528, 2006.

R. Puzis, Y. Elovici, P. Zilberman, S. Dolev, and U. Brandes, Topology manipulations for speeding betweenness centrality computation, Journal of Complex Networks, vol.3, issue.1, pp.84-112, 2015.

Y. Rabinovich, J. A. Telle, and M. Vatshelle, Upper bounds on boolean-width with applications to exact algorithms, International Symposium on Parameterized and Exact Computation (IPEC), vol.8246, pp.308-320

. Springer, , 2013.

M. Rao, Clique-width of graphs defined by one-vertex extensions, Discrete Mathematics, vol.308, issue.24, pp.6157-6165, 2008.
URL : https://hal.archives-ouvertes.fr/lirmm-00808032

M. Rao, Solving some NP-complete problems using split decomposition, Discrete Applied Mathematics, vol.156, issue.14, pp.2768-2780, 2008.
URL : https://hal.archives-ouvertes.fr/lirmm-00324549

N. Robertson and P. D. Seymour, Graph minors. II. algorithmic aspects of tree-width, Journal of Algorithms, vol.7, issue.3, pp.309-322, 1986.

L. Roditty, V. , and V. Williams, Fast approximation algorithms for the diameter and radius of sparse graphs, ACM Symposium on the Theory of Computing (STOC), pp.515-524, 2013.

P. Scheffler, A linear algorithm for the pathwidth of trees, Topics in combinatorics and graph theory, pp.613-620, 1990.

M. Soto-gómez, Quelques propriétés topologiques des graphes et applicationsà internet et aux réseaux, 2011.

D. P. Sumner, Graphs indecomposable with respect to the X-join, Discrete Mathematics, vol.6, issue.3, pp.281-298, 1973.

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

V. Williams, Hardness of easy problems: Basing hardness on popular conjectures such as the strong exponential time hypothesis, International Symposium on Parameterized and Exact Computation (IPEC), vol.43, pp.16-28, 2015.

V. Williams and R. R. Williams, Subcubic equivalences between path, matrix and triangle problems, IEEE Symposium on Foundations of Computer Science (FOCS), pp.645-654, 2010.

M. Yu and C. Yang, An O(n)-time algorithm for maximum matching on cographs, Information Processing Letter, vol.47, issue.2, pp.89-93, 1993.

, For an arbitrary graph G exactly one of the following conditions is satisfied. 1. G is disconnected, Theorem, vol.27

, 2. G is disconnected

, There is a unique proper separable p-connected component of G, with its separation being (V 1 , V 2 ) such that every vertex not in this component is adjacent to every vertex of V 1 and nonadjacent to every vertex of V 2

, G is, pp.p-connected

, If G or G is disconnected then it corresponds to a degenerate node in the modular decomposition tree. So we know how to handle with the two first cases

, A graph G is a p-tree if one of the following conditions hold: ? the quotient graph G of G is a P 4, Definition, vol.3

, ? the quotient graph G of G is a spiked p-chain P k , or its complement. Furthermore, G is obtained from G by replacing any of x, y, v 1

, ? the quotient graph G of G is a spiked p-chain Q k , or its complement. Furthermore, G is obtained from G by replacing any of v 1

, A p-connected component of a (q, q ? 3)-graph either contains less than q vertices, or is isomorphic to a prime spider, Theorem, vol.28, pp.p-tree

. Finally, We use the following characterization of separable p-connected components. Theorem 29 ( [76]). A p-connected graph G is separable if and only if its quotient graph is a split graph. Furthermore, its unique separation (V 1 , V 2 ) is given by the union V 1 of the strong modules inducing the clique and the union V 2 of the strong modules inducing the stable set

, By Theorem 27 there are two cases. First we assume G to be p-connected. By Theorem 28, G either contains less than q vertices, or is isomorphic to a prime spider, to a disc or to a p-tree. Furthermore, if G is a p-tree then according to Definition 3, the nontrivial modules can be characterized. So, we are done in this case. Otherwise, G is not p-connected. Let V = V 1 ? V 2 ? V 3 such that: H = G[V 1 ? V 2 ] is a separable p-component with separation