Determination of isomorphism and its applications for arbitrary graphs based on circuit simulation (Q733697): Difference between revisions
From MaRDI portal
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-008-9054-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1997158367 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Isomorphism of graphs of bounded valence can be tested in polynomial time / rank | |||
Normal rank | |||
Latest revision as of 01:17, 2 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Determination of isomorphism and its applications for arbitrary graphs based on circuit simulation |
scientific article |
Statements
Determination of isomorphism and its applications for arbitrary graphs based on circuit simulation (English)
0 references
19 October 2009
0 references
arbitrary graphs
0 references
graph isomorphism
0 references
adjoint circuit
0 references
computational complexity
0 references
