The SVE method for regular graph isomorphism identification (Q737027): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00034-015-0030-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1972978604 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A graph isomorphism algorithm for object recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compatible topologies on graphs: an application to graph isomorphism problem complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applied graph theory in computer vision and pattern recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial algorithms for open plane graph and subgraph isomorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determination of isomorphism and its applications for arbitrary graphs based on circuit simulation / rank
 
Normal rank

Latest revision as of 09:51, 12 July 2024

scientific article
Language Label Description Also known as
English
The SVE method for regular graph isomorphism identification
scientific article

    Statements

    The SVE method for regular graph isomorphism identification (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    5 August 2016
    0 references
    regular graph
    0 references
    graph isomorphism
    0 references
    circuit simulation method
    0 references
    single-vertex excitation (SVE) method
    0 references

    Identifiers