An Optimal Diagonal Tree Code (Q4750658): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1137/0604006 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1984295406 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4091421 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Diagonal tree codes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5572939 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The distance matrix of a graph and its tree realization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5659553 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A method for the linear recording of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5661516 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Technologies for constructing intelligent systems. 2: Tools / rank | |||
Normal rank |
Latest revision as of 17:48, 13 June 2024
scientific article; zbMATH DE number 3807630
Language | Label | Description | Also known as |
---|---|---|---|
English | An Optimal Diagonal Tree Code |
scientific article; zbMATH DE number 3807630 |
Statements
An Optimal Diagonal Tree Code (English)
0 references
1983
0 references
distance matrix
0 references
linear algorithms
0 references