Finding the prime factors of strong direct product graphs in polynomial time-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Finding the prime factors of strong direct product graphs in polynomial time

Published:1992-11 Issue:1-3 Volume:109 Page:77-102
ISSN:0012-365X
Container-title:Discrete Mathematics
language:en
Short-container-title:Discrete Mathematics

Author:

Feigenbaum Joan,Schäffer Alejandro A.

Publisher

Elsevier BV

Subject

Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference24 articles.

1. Computing equivalence classes among the edges of a graph with applications;Aurenhammer;Discrete Math.,1992

2. F. Aurenhammer, J. Hagauer and W. Imrich, Factoring Cartesian-product graphs at logarithmic cost per edge, Comput. Complexity, to appear.

3. Retracts of hypercubes;Bandelt;J. Graph Theory,1984

4. Finite graphs with two inequivalent factorizations under the composition operator;Coppersmith;IBM Research Report RC 11149,1985

5. Über das starke Produkt von endlichen Graphen;Dörfler;Mathem.-Natur. Kl. S.-B. II,1969

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

1. Robust Factorizations and Colorings of Tensor Graphs;SIAM Journal on Discrete Mathematics;2024-02-28

2. The Subset-Strong Product of Graphs;Annales Mathematicae Silesianae;2024-01-10

3. On some metric properties of direct-co-direct product;Applied Mathematics and Computation;2023-11

4. Observations on the Lovász θ-Function, Graph Capacity, Eigenvalues, and Strong Products †;Entropy;2023-01-04

5. Direct product primality testing of graphs is GI-hard;Theoretical Computer Science;2021-03

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP