From a simple elimination ordering to a strong elimination ordering in linear time

@article{Sawada2003FromAS,
  title={From a simple elimination ordering to a strong elimination ordering in linear time},
  author={Joe Sawada and Jeremy P. Spinrad},
  journal={Inf. Process. Lett.},
  year={2003},
  volume={86},
  pages={299-302}
}
We present a linear time algorithm for transforming a simple elimination ordering of a strongly chordal graph into a elimination ordering.  2003 Elsevier Science B.V. All rights reserved. 

From This Paper

Figures, tables, and topics from this paper.

Similar Papers

Loading similar papers…