Balance equations for reconstruction problems (Q1076692): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Reconstructing graphs from their k-edge deleted subgraphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5544087 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A note on the line reconstruction problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The edge reconstruction hypothesis is true for graphs with more than n log n edges / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Reconstruction from vertex-switching / rank | |||
Normal rank | |||
Revision as of 13:34, 17 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Balance equations for reconstruction problems |
scientific article |
Statements
Balance equations for reconstruction problems (English)
0 references
1987
0 references
A simple counting technique is presented which enables the giving of sufficient conditions for a wide class of reconstruction problems. In particular, we used this technique to prove Muller's result on edge- reconstruction and Stanley's result on vertex switching reconstruction.
0 references
counting technique
0 references
sufficient conditions
0 references
reconstruction problems
0 references
edge- reconstruction
0 references
vertex switching reconstruction
0 references
