Author:
Aurenhammer F.,Hagauer J.,Imrich W.
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science
Reference11 articles.
1. F. Aurenhammer, and J. Hagauer,Computing equivalence classes among the edges of a graph with applications, Proc. Int. Conf. Algebraic Graph Theory, 1989; and Discrete Math. Vol. 110, 1992.
2. T. Feder,Product Graph Representations, J. of Graph Theory, 1992 (to appear).
3. J. Feigenbaum,Product Graphs: Some algorithmic and combinatorial properties, Ph. D. Thesis, Dept. Comput Sci., Stanford. Univ., CA, 1986.
4. J. Feigenbaum, J. Hershberger, andA. Schäffer,A polynomial time algorithm for finding the prime factors of Cartesian-product graphs, Discrete Appl. Math. 12 1985, 123?138.
5. A. Gibbons,Algorithmic Graph Theory, Cambridge University Press, 1985.
Cited by
29 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献