Graph isomorphism judging method based on spectrum analysis

A spectrum analysis and graph isomorphism technology, which is applied in special data processing applications, instruments, electrical digital data processing, etc., can solve problems such as indeterminate graph isomorphism judgment, slow speed, graph failure, etc., and achieve simplified judgment time and speed Fast, accurate results

Active Publication Date: 2015-02-25
FUDAN UNIV
View PDF1 Cites 6 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Some algorithms are fast for specific graphs, but invalid for other types of graphs; although some algorithms have a wide range of applications, they are generally slow; some algorithms are only suitable for small-scale graphs, etc.; The isomorphism determination issue has been resolved

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Graph isomorphism judging method based on spectrum analysis
  • Graph isomorphism judging method based on spectrum analysis
  • Graph isomorphism judging method based on spectrum analysis

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0051] A typical example of the graph isomorphism judgment method based on spectral analysis proposed by the present invention is implemented on a notebook computer with 2GB memory and Intel Pentium 2.1GHz processor.

[0052] In order to make the above objects, features and advantages of the present invention more obvious and understandable, a specific example will be used to further illustrate below. In order to simplify the description, the test case of the present invention is a typical grid graph in the isomorphic library.

[0053] For two grid graphs g and h, the scales are 5*10 (that is, 5 vertices long and 10 vertices wide) and 10*5 (10 vertices long and 5 vertices wide), respectively. Such as figure 2 Shown; Find corresponding Laplace matrices L1 and L2 respectively, all adopt sparse format to store; First judge that the number of vertices and the number of edges of two graphs all correspond to equal, then according to the step of the present invention, graph is carr...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention belongs to the field of integrated circuits and relates to a graph isomorphism judging method based on spectrum analysis. The method includes: large-scale pure-resistor network graphs are modeled into non-mixing undirected simple graphs, two-dimensional planar graphs are mapped into one-dimensional distribution, and isomorphism of two graphs is judged according to processed one-dimensional distribution conditions. The method has the advantages that the method is accurate and fast in judging of the non-mixing undirected simple graphs, especially the large-scale non-mixing undirected simple graphs; the method is evidently faster than a Nauty method which is good in performance currently, and the method is well applicable to fields such as judging of identical sub-circuits in large-scale integrated circuits and judging the isomeride in organic chemistry.

Description

technical field [0001] The invention belongs to the field of integrated circuits, and in particular relates to a method for judging graph isomorphism based on spectrum analysis. Background technique [0002] With the increasing scale of integrated circuits, the extraction of sub-circuits from gate level to functional module level has begun to be applied in the field of EDA, and related algorithms will gradually become a research hotspot. The purpose of the extraction is to detect whether the target circuit contains a module with a specified function or structure, and to determine the number and location of the module; however, there is no efficient algorithm that can meet the needs of actual engineering. At present, the idea to solve the above problems is usually to model the circuit with a specified function or structure into a graph, and then solve the problem of sub-circuit extraction by judging whether the two graphs are isomorphic. [0003] The "graph" is a highly abst...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Applications(China)
IPC IPC(8): G06F17/50
Inventor 曾璇谢敏杨帆
Owner FUDAN UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap