On distance-preserving elimination orderings in graphs: Complexity and algorithms

David Coudert, Guillaume Ducoffe , Nicolas Nisse, Mauricio Soto. On distance-preserving elimination orderings in graphs: Complexity and algorithms. Discrete Applied Mathematics, 243:140-153, 2018. [doi]

@article{CoudertDNS18,
  title = {On distance-preserving elimination orderings in graphs: Complexity and algorithms},
  author = {David Coudert and Guillaume  Ducoffe  and Nicolas Nisse and Mauricio Soto},
  year = {2018},
  doi = {10.1016/j.dam.2018.02.007},
  url = {https://doi.org/10.1016/j.dam.2018.02.007},
  researchr = {https://researchr.org/publication/CoudertDNS18},
  cites = {0},
  citedby = {0},
  journal = {Discrete Applied Mathematics},
  volume = {243},
  pages = {140-153},
}