On the complexity of reconstructing H-free graphs from their Star Systems (Q3174240): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Reconstructing a Graph from its Neighborhood Lists / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Realizability and uniqueness in graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Isomorphism Testing and Symmetry of Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Neighborhood hypergraphs of bipartite graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Complement reducible graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Complexity of Reconstructing H-free Graphs from Their Star Systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Le problème d'étoiles pour graphes est NP-complèt / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some NP-Complete Problems Similar to Graph Isomorphism / rank | |||
Normal rank |
Latest revision as of 13:24, 4 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the complexity of reconstructing H-free graphs from their Star Systems |
scientific article |
Statements
On the complexity of reconstructing H-free graphs from their Star Systems (English)
0 references
12 October 2011
0 references
computational complexity
0 references