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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.