Pages that link to "Item:Q5634016"

The following pages link to Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph (Q5634016):

Displaying 50 items.

• A linear-time algorithm for the weighted feedback vertex problem on interval graphs (Q286981) (← links)
• A generalization of chordal graphs and the maximum clique problem (Q287036) (← links)
• The recognition of geodetically connected graphs (Q293190) (← links)
• Complexity of finding maximum regular induced subgraphs with prescribed degree (Q401302) (← links)
• Weighted maximum-clique transversal sets of graphs (Q410660) (← links)
• Creating non-minimal triangulations for use in inference in mixed stochastic/deterministic graphical models (Q415616) (← links)
• Approximation algorithms for intersection graphs (Q476425) (← links)
• Evader interdiction: algorithms, complexity and collateral damage (Q490228) (← links)
• On the kernel size of clique cover reductions for random intersection graphs (Q491163) (← links)
• Optimization problems in multiple subtree graphs (Q531599) (← links)
• Separator orders in interval, cocomparability, and AT-free graphs (Q534331) (← links)
• Minimum vertex cover in rectangle graphs (Q551504) (← links)
• Some properties of graphs determined by edge zeta functions (Q624533) (← links)
• Leader localization in multi-agent systems subject to failure: a graph-theoretic approach (Q642928) (← links)
• On recognizing and characterizing visibility graphs of simple polygons (Q677018) (← links)
• Computing role assignments of chordal graphs (Q708211) (← links)
• Graphs without large apples and the maximum weight independent set problem (Q742580) (← links)
• On finding a minimum vertex cover of a series-parallel graph (Q758196) (← links)
• Maximum induced matching problem on hhd-free graphs (Q765362) (← links)
• Mind the independence gap (Q776261) (← links)
• Some aspects of perfect elimination orderings in chordal graphs (Q792351) (← links)
• Finding maximum cliques in arbitrary and in special graphs (Q807639) (← links)
• Penta-extensions of hereditary classes of graphs (Q813334) (← links)
• One-sided discrete terrain guarding and chordal graphs (Q831703) (← links)
• Maximizing the weighted number of just-in-time jobs in flow shop scheduling (Q835569) (← links)
• Optimal register allocation for SSA-form programs in polynomial time (Q844183) (← links)
• Deciding \(k\)-colorability of \(P_5\)-free graphs in polynomial time (Q848637) (← links)
• Maximizing weighted number of just-in-time jobs on unrelated parallel machines (Q880513) (← links)
• Job distribution algorithms (Q885731) (← links)
• A hybrid tractable class for non-binary CSPs (Q903910) (← links)
• Covering orthogonal polygons with star polygons: The perfect graph approach (Q918225) (← links)
• Approximating the 2-interval pattern problem (Q932323) (← links)
• Counting the number of independent sets in chordal graphs (Q935840) (← links)
• Two methods for the generation of chordal graphs (Q940844) (← links)
• A constant approximation algorithm for the densest \(k\)-subgraph problem on chordal graphs (Q963469) (← links)
• On split-coloring problems (Q995923) (← links)
• On the parameterized complexity of multiple-interval graph problems (Q1001898) (← links)
• Center location problems on tree graphs with subtree-shaped customers (Q1005232) (← links)
• A linear time recognition algorithm for proper interval graphs (Q1014413) (← links)
• Scheduling with a minimum number of machines (Q1015305) (← links)
• The \(S\)-digraph optimization problem and the greedy algorithm (Q1019296) (← links)
• Laminar structure of ptolemaic graphs with applications (Q1028126) (← links)
• Large independent sets in random regular graphs (Q1034530) (← links)
• On powers and centers of chordal graphs (Q1055453) (← links)
• NP-complete problems simplified on tree schemas (Q1056539) (← links)
• Decomposition by clique separators (Q1062072) (← links)
• Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey (Q1062758) (← links)
• Concerning the achromatic number of graphs (Q1065819) (← links)
• Clustering and domination in perfect graphs (Q1068110) (← links)
• \(K_ i\)-covers. I: Complexity and polytopes (Q1070249) (← links)