Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs

Anne Bergeron, Cedric Chauve, Fabien de Montgolfier, Mathieu Raffinot. Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs. SIAM J. Discrete Math., 22(3):1022-1039, 2008. [doi]

@article{BergeronCMR08,
  title = {Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs},
  author = {Anne Bergeron and Cedric Chauve and Fabien de Montgolfier and Mathieu Raffinot},
  year = {2008},
  doi = {10.1137/060651331},
  url = {http://dx.doi.org/10.1137/060651331},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/BergeronCMR08},
  cites = {0},
  citedby = {0},
  journal = {SIAM J. Discrete Math.},
  volume = {22},
  number = {3},
  pages = {1022-1039},
}