Author:
Brandstädt Andreas,Giakoumakis Vassilis
Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference24 articles.
1. Recognizing weakly triangulated graphs by edge separability;Berry;Nordic Journal of Computing,2005
2. A. Brandstädt, V. Giakoumakis, F. Maffray, Clique separator decomposition of hole- and diamond-free graphs and algorithmic consequences, manuscript, 2011.
3. On clique separators, nearly chordal graphs and the Maximum Weight Stable Set problem;Brandstädt,2005
4. On independent vertex sets in subclasses of apple-free graphs;Brandstädt;Algorithmica,2010
5. On α-redundant vertices in P5-free graphs;Brandstädt;Information Processing Letters,2002
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献