Some recognition problems related to graph isomorphism (Q3470503): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Subcomplete generalizations of graph isomorphism / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Isomorphism of graphs of bounded valence can be tested in polynomial time / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: THE RELATIONSHIP BETWEEN THE COMPUTATIONAL COMPLEXITIES OF THE LEGITIMATE DECK AND ISOMORPHISM PROBLEMS / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5611528 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Set-Covering Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3050157 / rank | |||
Normal rank |
Latest revision as of 12:36, 20 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Some recognition problems related to graph isomorphism |
scientific article |
Statements
Some recognition problems related to graph isomorphism (English)
0 references
1988
0 references
computational complexity
0 references
graph isomorphism
0 references
mathematical programming
0 references
NP-complete
0 references
0 references