Author:
Ekim Tınaz,Erey Aysel,Heggernes Pinar,van ’t Hof Pim,Meister Daniel
Publisher
Springer Berlin Heidelberg
Reference23 articles.
1. Bertossi, A.A.: Dominating sets for split and bipartite graphs. Information Processing Letters 19, 37–40 (1984)
2. Brandstädt, A., Le, V.B., Spinrad, J.: Graph Classes: A Survey. SIAM Monographs on Discrete Mathematics and Applications (1999)
3. Buckley, F., Harary, F.: Geodetic games for graphs. Questiones Mathematicae 8, 321–334 (1986)
4. Corneil, D.G., Kim, H., Natarajan, S., Olariu, S., Sprague, A.P.: Simple linear time recognition of unit interval graphs. Information Processing Letters 55, 99–104 (1995)
5. Dewdney, A.K.: Fast Turing reductions between problems in NP. Technical Report 71, Department of Computer Science, University of Western Ontario (1981)
Cited by
30 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献