Gorzny, Jan; Huang, Jing End-vertices of LBFS of (AT-free) bigraphs. (English) Zbl 1361.05130 Discrete Appl. Math. 225, 87-94 (2017). MSC: 05C85 05C07 PDFBibTeX XMLCite \textit{J. Gorzny} and \textit{J. Huang}, Discrete Appl. Math. 225, 87--94 (2017; Zbl 1361.05130) Full Text: DOI arXiv
Aboulker, Pierre; Charbit, Pierre; Trotignon, Nicolas; Vušković, Kristina Vertex elimination orderings for hereditary graph classes. (English) Zbl 1306.05202 Discrete Math. 338, No. 5, 825-834 (2015). MSC: 05C75 05C85 PDFBibTeX XMLCite \textit{P. Aboulker} et al., Discrete Math. 338, No. 5, 825--834 (2015; Zbl 1306.05202) Full Text: DOI arXiv
Charbit, Pierre; Habib, Michel; Mamcarz, Antoine Influence of the tie-break rule on the end-vertex problem. (English) Zbl 1301.05329 Discrete Math. Theor. Comput. Sci. 16, No. 2, 57-72 (2014). MSC: 05C85 65F05 PDFBibTeX XMLCite \textit{P. Charbit} et al., Discrete Math. Theor. Comput. Sci. 16, No. 2, 57--72 (2014; Zbl 1301.05329) Full Text: Link
Fomin, Fedor V.; Villanger, Yngve Searching for better fill-in. (English) Zbl 1354.68121 Portier, Natacha (ed.) et al., 30th international symposium on theoretical aspects of computer science, STACS’ 13, Kiel, Germany, February 27 – March 2, 2013. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-50-7). LIPIcs – Leibniz International Proceedings in Informatics 20, 8-19 (2013). MSC: 68Q25 05C62 68R10 PDFBibTeX XMLCite \textit{F. V. Fomin} and \textit{Y. Villanger}, LIPIcs -- Leibniz Int. Proc. Inform. 20, 8--19 (2013; Zbl 1354.68121) Full Text: DOI
Chen, Ri-Xiang Minimal free resolutions of linear edge ideals. (English) Zbl 1221.13021 J. Algebra 324, No. 12, 3591-3613 (2010). Reviewer: Yukihide Takayama (Shiga) MSC: 13D02 13F55 PDFBibTeX XMLCite \textit{R.-X. Chen}, J. Algebra 324, No. 12, 3591--3613 (2010; Zbl 1221.13021) Full Text: DOI
Bretscher, Anna; Corneil, Derek; Habib, Michel; Paul, Christophe A simple linear time LexBFS cograph recognition algorithm. (English) Zbl 1187.05070 SIAM J. Discrete Math. 22, No. 4, 1277-1296 (2008). Reviewer: Haiko Müller (Leeds) MSC: 05C85 PDFBibTeX XMLCite \textit{A. Bretscher} et al., SIAM J. Discrete Math. 22, No. 4, 1277--1296 (2008; Zbl 1187.05070) Full Text: DOI Link
Heggernes, Pinar; Peyton, Barry W. Fast computation of minimal fill inside a given elimination ordering. (English) Zbl 1176.65027 SIAM J. Matrix Anal. Appl. 30, No. 4, 1424-1444 (2008). MSC: 65F05 65F50 05C85 05C90 PDFBibTeX XMLCite \textit{P. Heggernes} and \textit{B. W. Peyton}, SIAM J. Matrix Anal. Appl. 30, No. 4, 1424--1444 (2008; Zbl 1176.65027) Full Text: DOI
Villanger, Yngve Lex M versus MCS-M. (English) Zbl 1084.05071 Discrete Math. 306, No. 3, 393-400 (2006). MSC: 05C85 68R10 PDFBibTeX XMLCite \textit{Y. Villanger}, Discrete Math. 306, No. 3, 393--400 (2006; Zbl 1084.05071) Full Text: DOI
Heggernes, Pinar; Telle, Jan Arne; Villanger, Yngve Computing minimal triangulations in time \(O(n^{\alpha \log n}) = o(n^{2.376})\). (English) Zbl 1297.05120 Proceedings of the sixteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2005, Vancouver, BC, Canada, January 23–25, 2005. New York, NY: ACM Press (ISBN 0-89871-585-7). 907-916 (2005). MSC: 05C35 05C85 PDFBibTeX XMLCite \textit{P. Heggernes} et al., in: Proceedings of the sixteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2005, Vancouver, BC, Canada, January 23--25, 2005. New York, NY: ACM Press. 907--916 (2005; Zbl 1297.05120)
Heggernes, Pinar; Telle, Jan Arne; Villanger, Yngve Computing minimal triangulations in time \(O(n^{\alpha}\log n) = o(n ^{2.376})\). (English) Zbl 1105.05066 SIAM J. Discrete Math. 19, No. 4, 900-913 (2005). MSC: 05C85 68R10 05C50 PDFBibTeX XMLCite \textit{P. Heggernes} et al., SIAM J. Discrete Math. 19, No. 4, 900--913 (2005; Zbl 1105.05066) Full Text: DOI
Peyton, Barry W. Minimal orderings revisited. (English) Zbl 1044.65035 SIAM J. Matrix Anal. Appl. 23, No. 1, 271-294 (2001). Reviewer: George A. Gravvanis (Athens) MSC: 65F30 65F05 65F50 PDFBibTeX XMLCite \textit{B. W. Peyton}, SIAM J. Matrix Anal. Appl. 23, No. 1, 271--294 (2001; Zbl 1044.65035) Full Text: DOI
Brandstädt, Andreas; Dragan, Feodor F.; Nicolai, Falk LexBFS-orderings and powers of chordal graphs. (English) Zbl 0880.05074 Discrete Math. 171, No. 1-3, 27-42 (1997). Reviewer: Ján Plesník (Bratislava) MSC: 05C75 05C85 PDFBibTeX XMLCite \textit{A. Brandstädt} et al., Discrete Math. 171, No. 1--3, 27--42 (1997; Zbl 0880.05074) Full Text: DOI
Tarjan, Robert E.; Yannakakis, Mihalis Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. (English) Zbl 0545.68062 SIAM J. Comput. 13, 566-579 (1984). MSC: 68R10 65F05 68P20 65F50 05C65 PDFBibTeX XMLCite \textit{R. E. Tarjan} and \textit{M. Yannakakis}, SIAM J. Comput. 13, 566--579 (1984; Zbl 0545.68062) Full Text: DOI