scientific article; zbMATH DE number 3513839

Cited in

(49)

Generating subgraphs in chordal graphs
Computing maximum independent set on outerstring graphs and their relatives
Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review
Algorithms for finding an independent \(\{K_1,K_2\}\)-packing of maximum weight in a graph
Bisimplicial separators
Graphs without large apples and the maximum weight independent set problem
Independent domination in chordal graphs
On P₅-free locally split graphs
A polytime preprocess algorithm for the maximum independent set problem
New clique and independent set algorithms for circle graphs
Packing and covering a tree by subtrees
Approximating maximum weight \(K\)-colorable subgraphs in chordal graphs
Decomposition by clique separators
Some remarks on \(\lambda _{p,q}\)-connectedness
Stable sets of maximum weight in (\(P_{7}\), banner)-free graphs
On atomic structure of \(P_5\)-free subclasses and maximum weight independent set problem
Maximum independent set and maximum clique algorithms for overlap graphs
Intervention efficient algorithms for approximate learning of causal graphs
Maximum weight independent sets in hole- and dart-free graphs
Induced matchings
Hypergraphs with cyclomatic number zero, triangulated graphs, and an inequality
On algorithms for (P₅, gem)-free graphs
On efficient domination for some classes of \(H\)-free chordal graphs
New partitioning techniques and faster algorithms for approximate interval scheduling
Maximal chordal subgraphs
On the -interval and the -convexity numbers of graphs and graph products
The struction algorithm for the maximum stable set problem revisited
Structure of squares and efficient domination in graph classes
Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs
Approximation algorithms for intersection graphs
On a class of balanced hypergraphs
On efficient domination for some classes of \(H\)-free chordal graphs
A sufficient condition to extend polynomial results for the maximum independent set problem
An algorithm for source location in directed graphs
Grundy dominating sequences on X-join product
Weighted efficient domination in two subclasses of P₆-free graphs
Weighted coloring on planar, bipartite and split graphs: Complexity and approximation
Treewidth versus clique number. I: Graph classes with a forbidden structure
Arc-consistency with linear programming reduced costs (applied to stable set in chordal graphs)
On distance-3 matchings and induced matchings
A decomposition strategy for the vertex cover problem
On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem
Stackelberg packing games
Incremental optimization of independent sets under the reconfiguration framework
The path partition problem and related problems in bipartite graphs
Perspectives on \(A\)-homotopy theory and its applications
A \textit{branch} \& \textit{price} algorithm for the minimum cost clique cover problem in max-point tolerance graphs
Packing \(r\)-cliques in weighted chordal graphs
Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4093489)