Pages that link to "Item:Q5634016"
From MaRDI portal
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 44 items.
- New linear time algorithms for generating perfect elimination orderings of chordal graphs (Q1350607) (← links)
- Proper interval graphs and the guard problem (Q1363667) (← links)
- Maximum vertex-weighted matching in strongly chordal graphs (Q1392564) (← links)
- Induced matchings in intersection graphs. (Q1427466) (← links)
- Enumerating all connected maximal common subgraphs in two graphs (Q1589412) (← links)
- Stability number in subclasses of \(P_5\)-free graphs (Q1764380) (← links)
- An algorithm for source location in directed graphs (Q1779694) (← links)
- Chromatic numbers of competition graphs (Q1805322) (← links)
- On a 2-dimensional equipartition problem (Q1806658) (← links)
- Parameterized complexity of vertex colouring (Q1811065) (← links)
- Graph-theoretical properties of parallelism in the digital plane (Q1861556) (← links)
- Algorithmic aspects of the generalized clique-transversal problem on chordal graphs (Q1917287) (← links)
- Strongly orderable graphs. A common generalization of strongly chordal and chordal bipartite graphs (Q1962062) (← links)
- New results on induced matchings (Q1975379) (← links)
- Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs (Q2266936) (← links)
- A faster algorithm to recognize undirected path graphs (Q2367409) (← links)
- The densest \(k\)-subgraph problem on clique graphs (Q2426654) (← links)
- On guarding the vertices of rectilinear domains (Q2477198) (← links)
- Tree decomposition and discrete optimization problems: a survey (Q2480502) (← links)
- The intersection graphs of subtrees in trees are exactly the chordal graphs (Q2562090) (← links)
- One-way and round-trip center location problems (Q2568335) (← links)
- Independent packings in structured graphs (Q2583122) (← links)
- A Scheme for Computing Minimum Covers within Simple Regions (Q3183475) (← links)
- A Note on k-Colorability of P 5-Free Graphs (Q3599143) (← links)
- The <i>k</i>-Domination and <i>k</i>-Stability Problems on Sun-Free Chordal Graphs (Q3697054) (← links)
- Convexity in Graphs and Hypergraphs (Q3718757) (← links)
- A Dynamic Programming Approach to the Dominating Set Problem on <i>k</i>-Trees (Q3773922) (← links)
- A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles (Q3899836) (← links)
- Polynomially bounded algorithms for locatingp-centers on a tree (Q3947422) (← links)
- An algorithm for the maximum internally stable set in a weighted graph (Q3968462) (← links)
- ?-Perfect graphs (Q4007468) (← links)
- Vertex packings: Structural properties and algorithms (Q4074668) (← links)
- A parallel algorithm to generate all maximal independent sets on permutation graphs (Q4392327) (← links)
- Using Fifth Generation Tools for Solving the Clique Number Problem (Q4712613) (← links)
- SCHEDULING INTERVAL ORDERS IN PARALLEL (Q4820141) (← links)
- On the existence of convex decompositions of partially separable functions (Q5186653) (← links)
- Structural Learning with Time-Varying Components: Tracking the Cross-Section of Financial Time Series (Q5313454) (← links)
- On the complexity of alpha conversion (Q5444695) (← links)
- Heuristic and metaheuristic methods for computing graph treewidth (Q5479837) (← links)
- (Q5708515) (← links)
- A branch and bound algorithm for the maximum clique problem (Q5899820) (← links)
- A note on \(\alpha\)-redundant vertices in graphs (Q5929313) (← links)
- Approximation algorithms for maximum two-dimensional pattern matching (Q5941062) (← links)
- Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs (Q5959375) (← links)