The most vital nodes with respect to independent set and vertex cover-Reference-Cited by-同舟云学术

The most vital nodes with respect to independent set and vertex cover

Published:2011-10 Issue:17 Volume:159 Page:1933-1946
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Bazgan Cristina,Toubaline Sonia,Tuza Zsolt

Funder

Hungarian Scientific Research Fund, OTKA

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference24 articles.

1. A. Bar-Noy, S. Khuller, B. Schieber, The complexity of finding most vital arcs and nodes, Technical Report CS-TR-3539, Department of Computer Science, University of Maryland, 1995.

2. Complexity of most vital nodes for independent set in graphs related to tree structures;Bazgan,2011

3. C. Bazgan, S. Toubaline, D. Vanderpooten, Détermination des éléments les plus vitaux pour le problème d’affectation, in: Actes de la 10ème Conférence de la Société Française de Recherche Opérationelle et d’Aide à la Décision, ROADEF 2010, 2010.

4. Complexity of determining the most vital elements for the 1-median and 1-center location problems;Bazgan,2010

5. Approximation of satisfactory bisection problems;Bazgan;Journal of Computer and System Sciences,2008

Cited by 42 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On blockers and transversals of maximum independent sets in co-comparability graphs;Discrete Applied Mathematics;2024-10

2. The Robust Chromatic Number of Graphs;Graphs and Combinatorics;2024-07-27

3. On supervalid inequalities for binary interdiction games;Mathematical Programming;2024-07-27

4. The critical node game;Journal of Combinatorial Optimization;2024-05-18

5. Effectiveness of the MineReduce approach in reducing the size of combinatorial optimization problem instances;RAIRO - Operations Research;2024-03