Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference32 articles.
1. Beisegel, J., Denkert, C., Köhler, E., Krnc, M., Pivac, N., Scheffler, R., Strehler, M.: On the end-vertex problem of graph searches. Discrete Math. Theor. Comput. Sci. 21(1), (2019). https://doi.org/10.23638/DMTCS-21-1-13
2. Bernstein, P.A., Goodman, N.: Power of natural semijoins. SIAM J. Comput. 10(4), 751–771 (1981). https://doi.org/10.1137/0210059
3. Berry, A., Blair, J.R.S., Bordat, J.P., Simonet, G.: Graph extremities defined by search algorithms. Algorithms 3(2), 100–124 (2010). https://doi.org/10.3390/a3020100
4. Berry, A.: Separability generalizes Dirac’s theorem. Discrete Appl. Math. 84(1–3), 43–53 (1998). https://doi.org/10.1016/S0166-218X(98)00005-5
5. Blair, J.R.S., Peyton, B.W.: An introduction to chordal graphs and clique trees. In: George, J.A., Gilbert, J.R., Liu, J.W.-H. (eds.) Graph Theory and Sparse Matrix Computation, Volume 56 of IMA, pp. 1–29. Springer, Berlin (1993)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Graph Search Trees and Their Leaves;Graph-Theoretic Concepts in Computer Science;2023
2. Linearizing Partial Search Orders;Graph-Theoretic Concepts in Computer Science;2022