Characterizing (quasi-)ultrametric finite spaces in terms of (directed) graphs (Q444440): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Vladimir A. Gurvich / rank
Normal rank
 
Property / author
 
Property / author: Mikhail N. Vyalyi / rank
Normal rank
 
Property / author
 
Property / author: Q591378 / rank
Normal rank
 
Property / author
 
Property / author: Vladimir A. Gurvich / rank
 
Normal rank
Property / author
 
Property / author: Mikhail N. Vyalyi / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2012.03.034 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2078658343 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs whose maximal cliques and stable sets intersect / rank
 
Normal rank
Property / cites work
 
Property / cites work: Not complementary connected and not CIS \(d\)-graphs form weakly monotone families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counterexamples for Directed and Node Capacitated Cut-Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting Minimum Weight Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Cartesian Trees and Range Minimum Queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Encyclopedia of Distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal Flow Through a Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: The directed subgraph homeomorphism problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4766894 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-Terminal Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3666625 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3741636 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing complete edge-chromatic graphs and hypergraphs. Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metric and ultrametric spaces of resistances / rank
 
Normal rank
Property / cites work
 
Property / cites work: On exact blockers and anti-blockers, \(\varDelta \)-conjecture, and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metric and ultrametric spaces of resistances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3996836 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5595961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the shortest spanning subtree of a graph and the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3933032 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximity on equilateral spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3738240 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2752023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2751735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The category of ultrametric spaces is isomorphic to the category of complete, atomic, tree-like, and real graduated lattices LAT\(^*\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a universal ultrametric space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trees as semilattices / rank
 
Normal rank

Latest revision as of 14:08, 5 July 2024

scientific article
Language Label Description Also known as
English
Characterizing (quasi-)ultrametric finite spaces in terms of (directed) graphs
scientific article

    Statements

    Characterizing (quasi-)ultrametric finite spaces in terms of (directed) graphs (English)
    0 references
    14 August 2012
    0 references
    distance
    0 references
    ultrametric
    0 references
    spanning tree
    0 references
    minimum cut
    0 references
    maximum flow
    0 references
    Gomory
    0 references
    Hu tree
    0 references
    widest bottleneck path
    0 references
    decomposing \(n\)-graphs
    0 references
    positional game
    0 references
    0 references
    0 references

    Identifiers