Publisher
Springer International Publishing
Reference22 articles.
1. Beeri, C., Fagin, R., Maier, D., Yannakakis, M.: On the desirability of acyclic database schemes. J. ACM 30(3), 479–513 (1983). https://doi.org/10.1145/2402.322389
2. Berry, A., Simonet, G.: Computing the atom graph of a graph and the union join graph of a hypergraph. CoRR abs/1607.02911 (2016)
3. Borassi, M., Crescenzi, P., Habib, M.: Into the square: on the complexity of some quadratic-time solvable problems. Electron. Notes Theor. Comput. Sci. 322, 51–67 (2016). https://doi.org/10.1016/j.entcs.2016.03.005
4. Brandstädt, A., Dragan, F.F.: Tree-structured graphs. In: Handbook of Graph Theory, Combinatorial Optimization, and Algorithms, pp. 751–826. CRC Press (2015)
5. Brandstädt, A., Dragan, F.F., Chepoi, V., Voloshin, V.I.: Dually chordal graphs. SIAM J. Discret. Math. 11(3), 437–455 (1998). https://doi.org/10.1137/S0895480193253415
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献