Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
From MaRDI portal
(Redirected from Publication:5634016)
Cited in
(only showing first 100 items - show all)- On graphs whose eternal vertex cover number and vertex cover number coincide
- Vertex cover in conflict graphs
- Layered graphs: applications and algorithms
- Efficient Algorithms for (3,1) Graphs
- Concerning the achromatic number of graphs
- The multicolored graph realization problem
- Complexity of finding maximum regular induced subgraphs with prescribed degree
- Independent set reconfiguration in cographs and their generalizations
- Separator orders in interval, cocomparability, and AT-free graphs
- The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
- One-sided discrete terrain guarding and chordal graphs
- Optimization problems in multiple subtree graphs
- scientific article; zbMATH DE number 7651188 (Why is no real title available?)
- Minimum vertex cover in rectangle graphs
- Constrained Hitting Set and Steiner Tree in SCk and 2K2-free Graphs
- A \(\frac{5}{2}\)-approximation algorithm for coloring rooted subtrees of a degree 3 tree
- An algorithm for the maximum internally stable set in a weighted graph
- The maximum clique problem
- Heuristic and metaheuristic methods for computing graph treewidth
- Vertex Cover in Conflict Graphs: Complexity and a Near Optimal Approximation
- On coloring problems with local constraints
- Weighted maximum-clique transversal sets of graphs
- Tree decomposition and discrete optimization problems: a survey
- Labeling algorithms for domination problems in sun-free chordal graphs
- Graphs without large apples and the maximum weight independent set problem
- An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph
- Connected proper interval graphs and the guard problem in spiral polygons (extended abstract)
- Maximizing the weighted number of just-in-time jobs in flow shop scheduling
- Computing the 2-blocks of directed graphs
- A parallel algorithm to generate all maximal independent sets on permutation graphs
- Maximizing weighted number of just-in-time jobs on unrelated parallel machines
- Independent packings in structured graphs
- Creating non-minimal triangulations for use in inference in mixed stochastic/deterministic graphical models
- A hybrid tractable class for non-binary CSPs
- Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs
- On strict (outer-)confluent graphs
- Optimal register allocation for SSA-form programs in polynomial time
- On strict (outer-)confluent graphs
- Deciding \(k\)-colorability of \(P_5\)-free graphs in polynomial time
- A refined analysis of online path coloring in trees
- Computational complexity of the vertex cover problem in the class of planar triangulations
- Query-Competitive Sorting with Uncertainty.
- A constant approximation algorithm for the densest \(k\)-subgraph problem on chordal graphs
- A branch and bound algorithm for the maximum clique problem
- Proper interval vertex deletion
- Decomposition by clique separators
- Clustering and domination in perfect graphs
- Intersection graphs of paths in a tree
- A linear time recognition algorithm for proper interval graphs
- Distance-\(d\) independent set problems for bipartite and chordal graphs
- Approximation and kernelization for chordal vertex deletion
- A linear-time algorithm for the weighted feedback vertex problem on interval graphs
- A generalization of chordal graphs and the maximum clique problem
- The complexity of dissociation set problems in graphs
- On the characterization of chordal graphs using Horn hypergeometric series
- ?-Perfect graphs
- Stability number in subclasses of \(P_5\)-free graphs
- Latent association graph inference for binary transaction data
- Edge clique partition in \((k,\ell)\)-graphs
- Approximation algorithm for the distance-3 independent set problem on cubic graphs
- On the algorithmic aspects of strong subcoloring
- Efficient algorithms for minimum weighted colouring of some classes of perfect graphs
- Center location problems on tree graphs with subtree-shaped customers
- Strongly orderable graphs. A common generalization of strongly chordal and chordal bipartite graphs
- A lower bound of the cd-chromatic number and its complexity
- Proper interval graphs and the guard problem
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
- Intersection graphs of concatenable subtrees of graphs
- The recognition of geodetically connected graphs
- Linear time algorithms for NP-hard problems restricted to partial k- trees
- Maximum induced matching problem on hhd-free graphs
- Optimal approximation algorithms for maximum distance-bounded subgraph problems
- New linear time algorithms for generating perfect elimination orderings of chordal graphs
- Optimal approximation algorithms for maximum distance-bounded subgraph problems
- Some simplified NP-complete graph problems
- Perfect elimination orderings for symmetric matrices
- Computing role assignments of chordal graphs
- Structural Learning with Time-Varying Components: Tracking the Cross-Section of Financial Time Series
- Evader interdiction: algorithms, complexity and collateral damage
- Monadic second-order definable graph transductions: a survey
- A Note on k-Colorability of P 5-Free Graphs
- Chordality of graphs associated to commutative rings
- Conceptual clique sampling frameworks to design solution algorithms for the edge clique cover problem
- Vertex deletion problems on chordal graphs
- The private neighbor concept
- Induced matchings
- On some optimization problems on \(k\)-trees and partial \(k\)-trees
- On powers and centers of chordal graphs
- Independent set under a change constraint from an initial solution
- Weighted Maximum Independent Set of Geometric Objects in Turnstile Streams.
- \(K_ i\)-covers. I: Complexity and polytopes
- Model rejection and parameter reduction via time series
- Scheduling with a minimum number of machines
- Subexponential parameterized algorithms and kernelization on almost chordal graphs
- scientific article; zbMATH DE number 7378700 (Why is no real title available?)
- An algorithm for testing chordality of graphs
- Approximation algorithms for maximum two-dimensional pattern matching
- On the parameterized complexity of multiple-interval graph problems
- The complexity of generalized clique covering
- The complexity of comparability graph recognition and coloring
This page was built for publication: Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5634016)
