Faster Algorithms for the Minimum Red-Blue-Purple Spanning Graph Problem (Q2985117): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: MapSets / 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.7155/jgaa.00427 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2604563026 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-planar graphs have a linear number of edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-colored spanning graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5581251 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path-based supports for hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Planar Supports for Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: MapSets: Visualizing Embedded and Clustered Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colored Spanning Graphs for Set Visualization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colored spanning graphs for set visualization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subdivision Drawings of Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank

Latest revision as of 20:20, 13 July 2024

scientific article
Language Label Description Also known as
English
Faster Algorithms for the Minimum Red-Blue-Purple Spanning Graph Problem
scientific article

    Statements