On the red/blue spanning tree problem (Q534557): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Ming-Hui Jiang / rank
Normal rank
 
Property / author
 
Property / author: Ming-Hui Jiang / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q17 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68U05 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 5895902 / rank
 
Normal rank
Property / zbMATH Keywords
 
computational geometry
Property / zbMATH Keywords: computational geometry / rank
 
Normal rank
Property / zbMATH Keywords
 
spanning tree
Property / zbMATH Keywords: spanning tree / rank
 
Normal rank
Property / zbMATH Keywords
 
crossing number
Property / zbMATH Keywords: crossing number / 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.tcs.2010.10.038 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2149317979 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar bichromatic minimum spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convex layers of a planar set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5786239 / 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: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing Number is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing number is hard for cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549636 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:15, 4 July 2024

scientific article
Language Label Description Also known as
English
On the red/blue spanning tree problem
scientific article

    Statements

    On the red/blue spanning tree problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    18 May 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    computational geometry
    0 references
    spanning tree
    0 references
    crossing number
    0 references
    0 references