A local prime factor decomposition algorithm-Reference-Cited by-同舟云学术

A local prime factor decomposition algorithm

Published:2011-06 Issue:12 Volume:311 Page:944-965
ISSN:0012-365X
Container-title:Discrete Mathematics
language:en
Short-container-title:Discrete Mathematics

Author:

Hellmuth Marc

Publisher

Elsevier BV

Subject

Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference37 articles.

1. TopoLayout: Multilevel graph layout by topological features;Archambault;IEEE Trans. Vis. Comput. Graphics,2007

2. On subgraphs of Cartesian product graphs and S-primeness;Brešar;Discrete Math.,2004

3. Über das starke Produkt von endlichen Graphen;Dörfler;Österreih. Akad. Wiss., Mathem.-Natur. Kl., S.-B.II,1969

4. J. Feigenbaum, Product graphs: some algorithmic and combinatorial results. Technical Report STAN-CS-86-1121, Stanford University, Computer Science, Ph.D. Thesis, 1986.

5. On factorable extensions and subgraphs of prime graphs;Feigenbaum;SIAM J. Discrete Math.,1989

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Covering Arrays on Product Graphs;Graphs and Combinatorics;2017-05-24

2. On the Cartesian skeleton and the factorization of the strong product of digraphs;Theoretical Computer Science;2015-02

3. Strong products of hypergraphs: Unique prime factorization theorems and algorithms;Discrete Applied Mathematics;2014-07

4. Unique square property, equitable partitions, and product-like graphs;Discrete Mathematics;2014-04

5. Partial Star Products: A Local Covering Approach for the Recognition of Approximate Cartesian Product Graphs;Mathematics in Computer Science;2013-07-04