A Heuristic for Direct Product Graph Decomposition (Q6075715): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.7155/jgaa.00635 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W3178365484 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent sets in tensor graph powers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Direct product primality testing of graphs is GI-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logspace computations in graph products / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finite automata approach to modeling the cross product of interconnection networks. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3005852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring cardinal product graphs in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3412130 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2896064 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ubiquitous Kronecker product / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4327444 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Kronecker Product of Graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.7155/JGAA.00635 / rank
 
Normal rank

Latest revision as of 18:14, 30 December 2024

scientific article; zbMATH DE number 7740699
Language Label Description Also known as
English
A Heuristic for Direct Product Graph Decomposition
scientific article; zbMATH DE number 7740699

    Statements

    A Heuristic for Direct Product Graph Decomposition (English)
    0 references
    0 references
    0 references
    0 references
    20 September 2023
    0 references
    directed, unweighted graphs
    0 references
    graph isomorphism
    0 references
    polynomial-time algorithm
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references