Two equivalent measures on weighted hypergraphs (Q860393): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.2006.04.013 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1998845480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sum of edge lengths of a multigraph drawn on a convex polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three Equivalent Partial Orders on Graphs with Real Edge-Weights Drawn on a Convex Polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete and Computational Geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lengths of tours and permutations on a vertex set of a convex polygon. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On circular layouts<sup>∗</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4496254 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstructing graphs from cut-set sizes / rank
 
Normal rank

Latest revision as of 11:05, 25 June 2024

scientific article
Language Label Description Also known as
English
Two equivalent measures on weighted hypergraphs
scientific article

    Statements

    Two equivalent measures on weighted hypergraphs (English)
    0 references
    0 references
    0 references
    9 January 2007
    0 references
    This paper is a further instalment of the authors' long series of papers. It introduces two measures on hypergraphs by the mean of weighted edges, and convex polygons, and areas. It is proved that the two measures are equivalent giving the same partial order for any two hypergraphs.
    0 references
    convex polygons
    0 references
    area
    0 references
    convex three-cuts
    0 references
    polynomial time algorithm
    0 references

    Identifiers