Skip to main content
Top

2014 | OriginalPaper | Chapter

Colored Modular and Split Decompositions of Graphs with Applications to Trigraphs

Authors : Michel Habib, Antoine Mamcarz

Published in: Graph-Theoretic Concepts in Computer Science

Publisher: Springer International Publishing

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

We introduce the colored decompositions framework, in which vertices of the graph can be equipped with colors, and in which the goal is to find decompositions of this graph that do not separate the color classes. In this paper, we give two linear time algorithms for the colored modular and split decompositions of graphs, and we apply them to give linear time algorithms for the modular and split decompositions of trigraphs, which improves a result of Thomassé, Trotignon and Vuskovic (2013). As a byproduct, we introduce the non-separating families that allow us to prove that those two decompositions have the same properties on graphs and on trigraphs.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
1.
go back to reference Bui-Xuan, B.-M., Habib, M., Rao, M.: Tree-representation of set families and applications to combinatorial decompositions. Eur. J. Comb. 33(5), 688–711 (2012)MathSciNetCrossRefMATH Bui-Xuan, B.-M., Habib, M., Rao, M.: Tree-representation of set families and applications to combinatorial decompositions. Eur. J. Comb. 33(5), 688–711 (2012)MathSciNetCrossRefMATH
2.
go back to reference Cerioli, M.R., Everett, H., de Figueiredo, C.M.H., Klein, S.: The homogeneous set sandwich problem. IPL 67(1), 31–35 (1998)CrossRef Cerioli, M.R., Everett, H., de Figueiredo, C.M.H., Klein, S.: The homogeneous set sandwich problem. IPL 67(1), 31–35 (1998)CrossRef
3.
go back to reference Charbit, P., de Montgolfier, F., Raffinot, M.: Linear time split decomposition revisited. SIAM J. Discrete Math. 26(2), 499–514 (2012)MathSciNetCrossRefMATH Charbit, P., de Montgolfier, F., Raffinot, M.: Linear time split decomposition revisited. SIAM J. Discrete Math. 26(2), 499–514 (2012)MathSciNetCrossRefMATH
5.
go back to reference Chudnovsky, M.: Berge trigraphs and their applications. Ph.D. thesis, Princeton University (2003) Chudnovsky, M.: Berge trigraphs and their applications. Ph.D. thesis, Princeton University (2003)
9.
go back to reference Chudnovsky, M., Trotignon, N., Trunck, T., Vuskovic, K.: Coloring perfect graphs with no balanced skew-partitions. CoRR, abs/1308.6444 (2013) Chudnovsky, M., Trotignon, N., Trunck, T., Vuskovic, K.: Coloring perfect graphs with no balanced skew-partitions. CoRR, abs/1308.6444 (2013)
10.
go back to reference Cournier, A., Habib, M.: A new linear algorithm for modular decomposition. In: Tison, Sophie (ed.) CAAP 1994. LNCS, vol. 787, pp. 68–84. Springer, Heidelberg (1994)CrossRef Cournier, A., Habib, M.: A new linear algorithm for modular decomposition. In: Tison, Sophie (ed.) CAAP 1994. LNCS, vol. 787, pp. 68–84. Springer, Heidelberg (1994)CrossRef
12.
go back to reference Dahlhaus, E.: Efficient parallel and linear time sequential split decomposition (extended abstract). In: Thiagarajan, P.S. (ed.) FSTTCS 1994. LNCS, vol. 880, pp. 171–180. Springer, Heidelberg (1994) Dahlhaus, E.: Efficient parallel and linear time sequential split decomposition (extended abstract). In: Thiagarajan, P.S. (ed.) FSTTCS 1994. LNCS, vol. 880, pp. 171–180. Springer, Heidelberg (1994)
13.
go back to reference Dahlhaus, E.: Parallel algorithms for hierarchical clustering and applications to split decomposition and parity graph recognition. J. Algorithms 36(2), 205–240 (2000)MathSciNetCrossRefMATH Dahlhaus, E.: Parallel algorithms for hierarchical clustering and applications to split decomposition and parity graph recognition. J. Algorithms 36(2), 205–240 (2000)MathSciNetCrossRefMATH
14.
go back to reference de Montgolfier, F.: Décomposition modulaire des graphes: théorie, extensions et algorithmes. Ph.D. thesis, Université Montpellier 2 (2003) de Montgolfier, F.: Décomposition modulaire des graphes: théorie, extensions et algorithmes. Ph.D. thesis, Université Montpellier 2 (2003)
16.
go back to reference Habib, M., Mamcarz, A., Montgolfier, F.: Computing h-joins with application to 2-modular decomposition. Algorithmica 70(2), 245–266 (2014)MathSciNet Habib, M., Mamcarz, A., Montgolfier, F.: Computing h-joins with application to 2-modular decomposition. Algorithmica 70(2), 245–266 (2014)MathSciNet
17.
go back to reference Mamcarz, A.: Some applications of vertex splitting for graph algorithms. Ph.D. thesis, University of Paris 7 (2014) Mamcarz, A.: Some applications of vertex splitting for graph algorithms. Ph.D. thesis, University of Paris 7 (2014)
18.
19.
go back to reference Tedder, M., Corneil, D.G., Habib, M., Paul, C.: Simpler linear-time modular decomposition via recursive factorizing permutations. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 634–645. Springer, Heidelberg (2008)CrossRef Tedder, M., Corneil, D.G., Habib, M., Paul, C.: Simpler linear-time modular decomposition via recursive factorizing permutations. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 634–645. Springer, Heidelberg (2008)CrossRef
20.
go back to reference Thomassé, S., Trotignon, N., Vuskovic, K.: Parameterized algorithm for weighted independent set problem in bull-free graphs. CoRR, abs/1310.6205 (2013) Thomassé, S., Trotignon, N., Vuskovic, K.: Parameterized algorithm for weighted independent set problem in bull-free graphs. CoRR, abs/1310.6205 (2013)
21.
go back to reference Trotignon, N., Vušković, K.: A structure theorem for graphs with no cycle with a unique chord and its consequences. ArXiv e-prints, September 2013 Trotignon, N., Vušković, K.: A structure theorem for graphs with no cycle with a unique chord and its consequences. ArXiv e-prints, September 2013
22.
go back to reference Trotignon, N.: Complexity of some trigraph problems. Private communication, 2013 Trotignon, N.: Complexity of some trigraph problems. Private communication, 2013
Metadata
Title
Colored Modular and Split Decompositions of Graphs with Applications to Trigraphs
Authors
Michel Habib
Antoine Mamcarz
Copyright Year
2014
DOI
https://doi.org/10.1007/978-3-319-12340-0_22

Premium Partner