A new algorithm for digraph isomorphism (Q4136562): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Backtrack Procedure for Isomorphism of Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Algorithm for Graph Isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4770975 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cospectral Graphs and Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3875946 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph isomorphism: A heuristic edge-partitioning-oriented algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Search for a unique incidence matrix of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Subgraph Isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: GIT—a heuristic program for testing pairs of directed line graphs for isomorphism / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01932396 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1973303066 / rank
 
Normal rank

Latest revision as of 08:46, 30 July 2024

scientific article; zbMATH DE number 3564332
Language Label Description Also known as
English
A new algorithm for digraph isomorphism
scientific article; zbMATH DE number 3564332

    Statements

    Identifiers

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