Publisher
Springer Nature Switzerland
Reference15 articles.
1. Böcker, S., Dress, A.W.M.: Recovering symbolically dated, rooted trees from symbolic ultrametrics. Adv. Math. 138, 105–125 (1998). https://doi.org/10.1006/aima.1998.1743
2. Corneil, D.G., Lerchs, H., Steward Burlingham, L.: Complement Reducible Graphs. Discr. Appl. Math. 3, 163–174 (1981)
3. Corneil, D.G., Perl, Y., Stewart, L.K.: A linear recognition algorithm for cographs. SIAM J. Comput. 14, 926–934 (1985)
4. Crespelle, C., Paul, C.: Fully dynamic recognition algorithm and certificate for directed cographs. Discr. Appl. Math. 154, 1722–1741 (2006)
5. Engelfriet, J., Harju, T., Proskurowski, A., Rozenberg, G.: Characterization and complexity of uniformly nonprimitive labeled 2-structures. Theor. Comp. Sci. 154, 247–282 (1996)