Submatrices of non-tree-realizable distance matrices (Q1163034): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Properties of the distance matrix of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the metric properties of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diagonal tree codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance matrix of a graph and its realizability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3207003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of distances in networks / 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: Q5592942 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the tree realizability of a distance matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Effect of a Connectivity Requirement on the Complexity of Maximum Subgraph Problems / rank
 
Normal rank

Latest revision as of 14:27, 13 June 2024

scientific article
Language Label Description Also known as
English
Submatrices of non-tree-realizable distance matrices
scientific article

    Statements

    Identifiers