Reconstruction of a graph from 2–vicinities of its vertices (Q3439285): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3975132 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5544087 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A congruence theorem for trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Reconstruction of objects from a minimum number of distorted patterns / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Efficient reconstruction of sequences / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Efficient reconstruction of sequences from their subsequences of supersequences / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4300682 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3259049 / rank | |||
Normal rank |
Latest revision as of 19:08, 25 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Reconstruction of a graph from 2–vicinities of its vertices |
scientific article |
Statements
Reconstruction of a graph from 2–vicinities of its vertices (English)
0 references
29 May 2007
0 references
graph reconstruction
0 references
2-vicinity
0 references
girth
0 references
neighbourhood
0 references
graph of neighbourhood
0 references
reconstruction algorithm
0 references