A Simple 2-Approximation for Maximum-Leaf Spanning Tree (Q6066463): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Proof verification and the hardness of approximation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic checking of proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Linear Time Minor Tests with Depth-First Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds for spanning trees with many leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconfiguration of Spanning Trees with Many or Few Leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Approximation Algorithm for the Maximum Independent Set Problem on Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-stabilizing systems in spite of distributed control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees with many leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Well-Partial-Order Theory and Its Application to Combinatorial Problems of VLSI Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short note on the approximability of the maximum leaves spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees with many leaves in cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximability of partitioning graphs with supply and demand / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning Distribution Trees of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning Trees with Many Leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Maximum Leaf Spanning Trees in Almost Linear Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: CANONICAL DECOMPOSITION, REALIZER, SCHNYDER LABELING AND ORDERLY SPANNING TREES OF PLANE GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: A LINEAR-TIME ALGORITHM TO FIND FOUR INDEPENDENT SPANNING TREES IN FOUR CONNECTED PLANAR GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for the Hamiltonian walk problem on maximal planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient approximation algorithms for bandwidth consecutive multicolorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arbres avec un nombre maximum de sommets pendants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252040 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 2-approximation algorithm for finding a spanning tree with maximum number of leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing full spanning trees for cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for finding a short closed spanning walk in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3928248 / rank
 
Normal rank

Revision as of 14:12, 3 August 2024

scientific article; zbMATH DE number 7766093
Language Label Description Also known as
English
A Simple 2-Approximation for Maximum-Leaf Spanning Tree
scientific article; zbMATH DE number 7766093

    Statements

    A Simple 2-Approximation for Maximum-Leaf Spanning Tree (English)
    0 references
    0 references
    0 references
    16 November 2023
    0 references
    approximation algorithms
    0 references
    maximum-leaf spanning tree
    0 references
    0 references
    0 references
    0 references

    Identifiers

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