Moplex orderings generated by the LexDFS algorithm

@article{Xu2013MoplexOG,
  title={Moplex orderings generated by the LexDFS algorithm},
  author={Shoujun Xu and Xianyue Li and Ronghua Liang},
  journal={Discrete Applied Mathematics},
  year={2013},
  volume={161},
  pages={2189-2195}
}
LetG be a graphwith vertex set V . Amoplex ofG is both a clique and amodulewhose neighborhood is aminimal separator inG or empty. Amoplex ordering ofG is an ordered partition (X1, X2, · · · , Xk) of V for some integer k into moplexes which are defined in the successive transitory elimination graphs, i.e., for 1 6 i 6 k− 1, Xi is a moplex of the graph Gi induced by ∪j=i Xj and Xk induces a clique. In this paper we prove the terminal vertex by an execution of the lexicographical depth-first… CONTINUE READING

References

Publications referenced by this paper.
SHOWING 1-10 OF 13 REFERENCES

An introduction to chordal graphs and clique trees

  • J.R.S. Blair, B. W. Peyton
  • in: J.A. George, J.R. Gilbert, J.W. Liu (Eds…
  • 1993
Highly Influential
4 Excerpts

Simple lineartime algorithms to test chordality of graphs , test acyclicity of hypergraphs , and selectively reduce acyclic hypergraphs

  • M. Yannakakis R. E. Tarjan
  • SIAM J . Comput .
  • 1984

Similar Papers

Loading similar papers…