SCOPUS 정보 검색 플랫폼

Volumn 2, Issue 4, 2009, Pages 653-682

Local algorithms for the prime factorization of strong product graphs

Author keywords

Backbone; Local covering; S1 condition; Strong product graphs

Indexed keywords

EID: 72149097856 PISSN: 16618270 EISSN: 16618289 Source Type: Journal
DOI: 10.1007/s11786-009-0073-y Document Type: Article

Times cited : (14)

References (9)

1
- 0006682106
- Ü ber das starke Produkt von endlichen Graphen
- W. Dörfler and W. Imrich. Ü ber das starke Produkt von endlichen Graphen. Österreih. Akad. Wiss., Mathem.-Natur. Kl., S.-B.II, 178:247-262, 1969.
- (1969) Österreih. Akad. Wiss., Mathem.-Natur. Kl., S.-B.II , Issue.178 , pp. 247-262
- Dörfler, W.¹ Imrich, W.²

2
- 72149110095
- Technical Report STAN-CS-86-1121, Stanford University, Computer Science, PhD Thesis
- J. Feigenbaum. Product graphs: some algorithmic and combinatorial results. Technical Report STAN-CS-86-1121, Stanford University, Computer Science, 1986. PhD Thesis.
- (1986) Product Graphs: Some Algorithmic and Combinatorial Results
- Feigenbaum, J.¹

3
- 0001781458
- Finding the prime factors of strong direct product graphs in polynomial time
- J. Feigenbaum and A. A. Schäffer. Finding the prime factors of strong direct product graphs in polynomial time. Discrete Math., 109:77-102, 1992.
- (1992) Discrete Math , vol.109 , pp. 77-102
- Feigenbaum, J.¹ Schäffer, A.A.²

4
- 63149129734
- Approximate graph products
- M. Hellmuth, W. Imrich, W. Klöckl, and P. F. Stadler. Approximate graph products. European Journal of Combinatorics, 30:1119-1133, 2009.
- (2009) European Journal of Combinatorics , vol.30 , pp. 1119-1133
- Hellmuth, M.¹ Imrich, W.² Klöckl, W.³ Stadler, P.F.⁴

5
- 0242458540
- Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley-Interscience, New York
- W. Imrich and S. Klavžar. Product graphs. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley-Interscience, New York, 2000.
- (2000) Product Graphs
- Imrich, W.¹ Klavžar, S.²

6
- 33845607309
- Recognizing cartesian products in linear time
- W. Imrich and I. Peterin. Recognizing cartesian products in linear time. Discrete Math., 307:472-482, 2007.
- (2007) Discrete Math , vol.307 , pp. 472-482
- Imrich, W.¹ Peterin, I.²

7
- 43049162168
- Graph products for configuration processing of space structures
- A. Kaveh and K. Koohestani. Graph products for configuration processing of space structures. Comput. Struct., 86:1219-1231, 2008.
- (2008) Comput. Struct , vol.86 , pp. 1219-1231
- Kaveh, A.¹ Koohestani, K.²

8
- 0037458350
- Quasi-independence, homology and the unity of type: A topological theory of characters
- G. Wagner and P. F. Stadler. Quasi-independence, homology and the unity of type: A topological theory of characters. J. Theor. Biol., 220:505-527, 2003.
- (2003) J. Theor. Biol , vol.220 , pp. 505-527
- Wagner, G.¹ Stadler, P.F.²

9
- 33845674689
- Weak reconstruction of strong product graphs
- B. Zmazek and J. Žerovnik. Weak reconstruction of strong product graphs. Discrete Math., 307:641-649, 2007.
- (2007) Discrete Math , vol.307 , pp. 641-649
- Zmazek, B.¹ Žerovnik, J.²

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.