A 2-approximation NC algorithm for connected vertex cover and tree cover (Q2390219): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A random NC algorithm for depth first search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the tree and tour covers of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3337223 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast and efficient NC algorithm for maximal matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for metric facility location and <i>k</i> -Median problems using the primal-dual schema and Lagrangian relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paradigms for Fast Parallel Approximability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228484 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472438 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Rectilinear Steiner Tree Problem is $NP$-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intersection graphs of subtrees in trees are exactly the chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved parallel algorithm that computes the BFS numbering of a directed graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast and simple randomized parallel algorithm for maximal matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal parallel algorithm for maximal matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234153 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753739 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Parallel Algorithm for the Maximal Independent Set Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramsey numbers and an approximation algorithm for the vertex cover problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching is as easy as matrix inversion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-first search and the vertex cover problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Parallel Biconnectivity Algorithm / rank
 
Normal rank

Latest revision as of 20:01, 1 July 2024

scientific article
Language Label Description Also known as
English
A 2-approximation NC algorithm for connected vertex cover and tree cover
scientific article

    Statements

    A 2-approximation NC algorithm for connected vertex cover and tree cover (English)
    0 references
    0 references
    0 references
    21 July 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    approximation algorithms
    0 references
    parallel algorithms
    0 references
    connected vertex cover
    0 references
    tree cover
    0 references
    0 references