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):

Displayed 50 items.

• On recognizing and characterizing visibility graphs of simple polygons (Q677018) ‎ (← links)
• On finding a minimum vertex cover of a series-parallel graph (Q758196) ‎ (← 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)
• Maximizing weighted number of just-in-time jobs on unrelated parallel machines (Q880513) ‎ (← links)
• Job distribution algorithms (Q885731) ‎ (← 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)
• 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)
• 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)
• Intersection graphs of paths in a tree (Q1077439) ‎ (← links)
• Linear time algorithms for NP-hard problems restricted to partial k- trees (Q1116705) ‎ (← links)
• Labeling algorithms for domination problems in sun-free chordal graphs (Q1117254) ‎ (← links)
• An application of vertex packing to data analysis in the evaluation of pavement deterioration (Q1165769) ‎ (← links)
• The edge Hamiltonian path problem is NP-complete (Q1169818) ‎ (← links)
• Locational analysis (Q1173002) ‎ (← links)
• Finding a minimal cover for binary images: An optimal parallel algorithm (Q1175643) ‎ (← links)
• Studies on hypergraphs. I: Hyperforests (Q1209154) ‎ (← links)
• An algorithm for testing chordality of graphs (Q1216324) ‎ (← links)
• A recognition algorithm for the intersection graphs of directed paths in directed trees (Q1219893) ‎ (← links)
• A note on the complexity of the chromatic number problem (Q1229753) ‎ (← links)
• Some simplified NP-complete graph problems (Q1230637) ‎ (← links)
• Comparability graphs and a new matroid (Q1235707) ‎ (← links)
• Efficient Algorithms for (3,1) Graphs (Q1240742) ‎ (← links)
• The complexity of comparability graph recognition and coloring (Q1241524) ‎ (← links)
• Algorithms on clique separable graphs (Q1246434) ‎ (← links)
• Linear algorithms on recursive representations of trees (Q1254104) ‎ (← links)
• A recognition algorithm for the intersection graphs of paths in trees (Q1254334) ‎ (← links)
• The complexity of generalized clique covering (Q1262127) ‎ (← links)
• Induced matchings (Q1262877) ‎ (← links)
• All structured programs have small tree width and good register allocation (Q1271620) ‎ (← links)
• On the algorithmic complexity of twelve covering and independence parameters of graphs (Q1283793) ‎ (← links)
• On some optimization problems on \(k\)-trees and partial \(k\)-trees (Q1315461) ‎ (← links)
• The maximum clique problem (Q1318271) ‎ (← links)
• Monadic second-order definable graph transductions: a survey (Q1325847) ‎ (← links)
• Intersection graphs of concatenable subtrees of graphs (Q1331898) ‎ (← links)
• The struction algorithm for the maximum stable set problem revisited (Q1332429) ‎ (← links)
• Efficient algorithms for minimum weighted colouring of some classes of perfect graphs (Q1339397) ‎ (← links)
• An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph (Q1341730) ‎ (← links)