A Note on Optimal and Suboptimal Digraph Realizations of Quasidistance Matrices (Q3320428): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
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/0605014 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1999684244 / rank
 
Normal rank
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: An Optimal Diagonal Tree Code / 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: Q5588444 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3207003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On optimal embeddings of metrics in graphs / 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: The theory and computation of evolutionary distances: Pattern recognition / 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: Submatrices of non-tree-realizable distance matrices / 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: Duality and Distance Constraints for the Nonlinear <i>p</i>-Center Problem and Covering Problem on a Tree Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technologies for constructing intelligent systems. 2: Tools / rank
 
Normal rank

Latest revision as of 12:24, 14 June 2024

scientific article
Language Label Description Also known as
English
A Note on Optimal and Suboptimal Digraph Realizations of Quasidistance Matrices
scientific article

    Statements

    A Note on Optimal and Suboptimal Digraph Realizations of Quasidistance Matrices (English)
    0 references
    0 references
    1984
    0 references
    0 references
    0 references
    0 references
    0 references
    quasimetrics
    0 references
    quasidistance matrices
    0 references
    optimal digraph realizations
    0 references
    minimum total length
    0 references
    0 references