Author:
Hellmuth Marc,Imrich Wilfried,Kupka Tomas
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Computational Mathematics
Reference23 articles.
1. Aurenhammer F., Hagauer J., Imrich W.: Cartesian graph factorization at logarithmic cost per edge. Comput. Complex. 2, 331–349 (1992)
2. Chiba N., Nishizeki T.: Arboricity and subgraph listing algorithms. SIAM J. Comput. 14(1), 210–223 (1985)
3. Feigenbaum, J.: Product graphs: some algorithmic and combinatorial results. Technical Report STAN-CS-86-1121, Stanford University, Computer Science, PhD Thesis (1986)
4. Feigenbaum J., Haddad R.A.: On factorable extensions and subgraphs of prime graphs. SIAM J. Discrete Math. 2, 197–218 (1989)
5. Feigenbaum J., Hershberger J., Schäffer A.A.: A polynomial time algorithm for finding the prime factors of Cartesian-product graphs. Discrete Appl. Math. 12, 123–138 (1985)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献