Reconstructing graphs from cut-set sizes (Q909677): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: A generalized model for understanding evasiveness / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5422499 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Upper bounds for configurations and polytopes in \({\mathbb{R}}^ d\) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5682013 / rank | |||
Normal rank |
Latest revision as of 13:36, 20 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Reconstructing graphs from cut-set sizes |
scientific article |
Statements
Reconstructing graphs from cut-set sizes (English)
0 references
1989
0 references
The n vertices of a graph embedded in the plane are in general position and the edges are straight line segments between pairs of vertices. A cut-set probe returns the number of edges intersected by a specified line. It is shown that such graphs are completely reconstructible from \(\left( \begin{matrix} n\\ 2\end{matrix} \right)\) cut-set probes and that this number of probes is necessary. For generalised cut-set probes, which determine the size of any cut-set of the graph, \(O(n^ 2/\log n)\) are shown to be necessary and sufficient for reconstruction.
0 references
cut-set probe
0 references
completely reconstructible
0 references