Author:
Crespelle Christophe,Thierry Eric
Funder
Vietnam Institute for Advanced Study in Mathematics
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference14 articles.
1. Cartesian graph factorization at logarithmic cost per edge;Aurenhammer;Comput. Complexity,1992
2. The strong perfect graph theorem;Chudnovsky;Ann. of Math.,2006
3. A linear-time algorithm for computing the prime decomposition of a directed graph with regard to the cartesian product;Crespelle,2013
4. Product graph representations;Feder;J. Graph Theory,1992
5. Directed cartesian-product graphs have unique factorizations that can be computed in polynomial time;Feigenbaum;Discrete Appl. Math.,1986
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献