Counting disjoint 2-partitions for points in the plane (Q2384393): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Separable partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex characterization of partition polytopes of bipartitions and of planar point sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal partitions having disjoint convex and conic hulls / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric clusterings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of partitions of a set of <i>N</i> points in <i>k</i> dimensions induced by hyperplanes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sortability of vector partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Time Algorithm for Shaped Partition Problems / rank
 
Normal rank

Revision as of 09:05, 27 June 2024

scientific article
Language Label Description Also known as
English
Counting disjoint 2-partitions for points in the plane
scientific article

    Statements

    Counting disjoint 2-partitions for points in the plane (English)
    0 references
    0 references
    21 September 2007
    0 references
    disjoint partitions
    0 references
    sortability
    0 references
    counting
    0 references
    optimal partitions
    0 references

    Identifiers