Planar bichromatic minimum spanning trees (Q1044035): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Bipartite embeddings of trees in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning arrangements of lines. II: Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Euclidean minimum spanning trees and bichromatic closest pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for degree-restricted MST and red-blue separation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON CONNECTING RED AND BLUE RECTILINEAR POLYGONAL OBSTACLES WITH NONINTERSECTING MONOTONE RECTILINEAR PATHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Point Location in General Subdivisions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar bichromatic minimum spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPUTING LARGEST CIRCLES SEPARATING TWO SETS OF SEGMENTS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Growing a Tree from Its Branches / rank
 
Normal rank
Property / cites work
 
Property / cites work: SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS / rank
 
Normal rank
Property / cites work
 
Property / cites work: AN OPTIMAL ALGORITHM FOR COMPUTING (≤K)-LEVELS, WITH APPLICATIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pointed and colored binary encompassing trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Encompassing colored planar straight line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separating objects in the plane by wedges and strips / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5692715 / 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: Planar Formulae and Their Uses / rank
 
Normal rank

Latest revision as of 07:26, 2 July 2024

scientific article
Language Label Description Also known as
English
Planar bichromatic minimum spanning trees
scientific article

    Statements

    Planar bichromatic minimum spanning trees (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    10 December 2009
    0 references
    0 references
    minimum spanning tree
    0 references
    bichromatic point set
    0 references
    planarity
    0 references
    computational geometry
    0 references
    0 references