Better hardness results for the minimum spanning tree congestion problem (Q6091160): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q4228453 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of the spanning tree congestion problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning tree congestion of \(k\)-outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree Spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Multiterminal Cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanners in sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Minimum Max-Stretch Spanning Trees on Unweighted Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree spanners in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general framework for graph sparsification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Designing multi-commodity flow trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning tree congestion of rook's graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On spanning tree congestion of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An independent dominating set in the complement of a minimum dominating set of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal congestion trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey on Spanning Tree Congestion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Results for the Spanning Tree Congestion Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3798268 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral Sparsification of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Term Rewriting and Applications / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:24, 19 August 2024

scientific article; zbMATH DE number 7770290
Language Label Description Also known as
English
Better hardness results for the minimum spanning tree congestion problem
scientific article; zbMATH DE number 7770290

    Statements

    Better hardness results for the minimum spanning tree congestion problem (English)
    0 references
    0 references
    0 references
    0 references
    24 November 2023
    0 references
    0 references