The most vital nodes with respect to independent set and vertex cover (Q411833): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Complexity of Most Vital Nodes for Independent Set in Graphs Related to Tree Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Determining the Most Vital Elements for the 1-median and 1-center Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of satisfactory bisection problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Recognition Algorithm for Cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum \(d\)-blockers and \(d\)-transversals in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds to the clique width of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875228 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple linear time algorithm for cograph recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Schemes for the Restricted Shortest Path Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On short paths interdiction problems: Total and node-wise limited interdiction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ruling Out PTAS for Graph Min‐Bisection, Dense k‐Subgraph, and Bipartite Clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth. Computations and approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hardness of approximation: Gap location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blockers and transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k\)-NLC graphs and polynomial algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic network interdiction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching interdiction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blockers and transversals / rank
 
Normal rank

Latest revision as of 03:54, 5 July 2024

scientific article
Language Label Description Also known as
English
The most vital nodes with respect to independent set and vertex cover
scientific article

    Statements

    The most vital nodes with respect to independent set and vertex cover (English)
    0 references
    0 references
    0 references
    0 references
    30 April 2012
    0 references
    most vital vertices
    0 references
    independent set
    0 references
    vertex cover
    0 references
    time complexity
    0 references
    NP-hard
    0 references
    bipartite graph
    0 references
    bounded treewidth
    0 references
    cograph
    0 references

    Identifiers