Planar Bichromatic Bottleneck Spanning Trees (Q5874461): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
label / enlabel / en
 
Planar Bichromatic Bottleneck Spanning Trees
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.4230/LIPIcs.ESA.2020.1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3082422232 / rank
 
Normal rank
Property / title
 
Planar Bichromatic Bottleneck Spanning Trees (English)
Property / title: Planar Bichromatic Bottleneck Spanning Trees (English) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite embeddings of trees in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the bottleneck plane perfect matching of a point set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bottleneck non-crossing matching 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: Matching Points with Things / 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: Maximum plane trees in multipartite geometric graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees in multipartite geometric graphs / 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: Planar bichromatic minimum spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to draw a planar graph on a grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching colored points in the plane: Some new results / rank
 
Normal rank
Property / cites work
 
Property / cites work: PARTITIONING COLORED POINT SETS INTO MONOCHROMATIC PARTS / 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: Q5692715 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Formulae and Their Uses / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:06, 31 July 2024

scientific article; zbMATH DE number 7651140
Language Label Description Also known as
English
Planar Bichromatic Bottleneck Spanning Trees
scientific article; zbMATH DE number 7651140

    Statements

    0 references
    0 references
    0 references
    0 references
    7 February 2023
    0 references
    approximation algorithms
    0 references
    bottleneck spanning tree
    0 references
    NP-hardness
    0 references
    Planar Bichromatic Bottleneck Spanning Trees (English)
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references