Pages that link to "Item:Q1108038"
From MaRDI portal
The following pages link to The maximum k-colorable subgraph problem for chordal graphs (Q1108038):
Displaying 50 items.
- A linear-time algorithm for the weighted feedback vertex problem on interval graphs (Q286981) (← links)
- Maximum \(h\)-colourable subgraph problem in balanced graphs (Q293269) (← links)
- Inverse chromatic number problems in interval and permutation graphs (Q319198) (← links)
- Refined algorithms for hitting many intervals (Q344570) (← links)
- The just-in-time scheduling problem in a flow-shop scheduling system (Q421784) (← links)
- The off-line group seat reservation problem (Q613435) (← links)
- Graph coloring with rejection (Q632809) (← links)
- Minimum entropy combinatorial optimization problems (Q693045) (← links)
- Fixed interval scheduling: models, applications, computational complexity and algorithms (Q859906) (← links)
- Selection of programme slots of television channels for giving advertisement: a graph theoretic approach (Q881882) (← links)
- The 0-1 inverse maximum stable set problem (Q955316) (← links)
- Minimum weight feedback vertex sets in circle graphs (Q963384) (← links)
- Just-in-time scheduling with controllable processing times on parallel machines (Q975765) (← links)
- Approximating maximum weight \(K\)-colorable subgraphs in chordal graphs (Q976121) (← links)
- Weighted sum coloring in batch scheduling of conflicting jobs (Q1031871) (← links)
- Solving the single step graph searching problem by solving the maximum two-independent set problem (Q1183488) (← links)
- An efficient algorithm for finding a maximum weight 2-independent set on interval graphs (Q1199945) (← links)
- The complexity of generalized clique covering (Q1262127) (← links)
- Optimal channel allocation for several types of cellular radio networks (Q1372738) (← links)
- Parameterized algorithms for Max Colorable Induced Subgraph problem on perfect graphs (Q1755775) (← links)
- Efficient algorithms for the double traveling salesman problem with multiple stacks (Q1762078) (← links)
- Vertex deletion problems on chordal graphs (Q1786595) (← links)
- Scheduling algorithm to select optimal programme slots in television channels: a graph theoretic approach (Q1791804) (← links)
- On the \(k\)-coloring of intervals (Q1893157) (← links)
- Algorithmic aspects of the generalized clique-transversal problem on chordal graphs (Q1917287) (← links)
- Algorithmic aspects of clique-transversal and clique-independent sets (Q1971220) (← links)
- Characterization of QUBO reformulations for the maximum \(k\)-colorable subgraph problem (Q2107015) (← links)
- Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review (Q2327955) (← links)
- Faster exact algorithms for some terminal set problems (Q2361353) (← links)
- A faster algorithm to recognize undirected path graphs (Q2367409) (← links)
- New upper bounds on feedback vertex numbers in butterflies (Q2390267) (← links)
- Maximizing the weighted number of just-in-time jobs in~several two-machine scheduling systems (Q2434268) (← links)
- The maximum vertex coverage problem on bipartite graphs (Q2448919) (← links)
- On the complexity of the selective graph coloring problem in some special classes of graphs (Q2453167) (← links)
- Reconfiguration of colorable sets in classes of perfect graphs (Q2632018) (← links)
- Parameterized and exact algorithms for class domination coloring (Q2659082) (← links)
- Fair allocation of indivisible items with conflict graphs (Q2701390) (← links)
- A sequential algorithm for finding a maximum weight<i>K</i>-independent set on interval graphs (Q2710758) (← links)
- (Q2861543) (← links)
- MINIMUM WEIGHT FEEDBACK VERTEX SETS IN CIRCLE n-GON GRAPHS AND CIRCLE TRAPEZOID GRAPHS (Q2890989) (← links)
- Large Induced Subgraphs via Triangulations and CMSO (Q2954371) (← links)
- Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey (Q2958665) (← links)
- Parameterized and Exact Algorithms for Class Domination Coloring (Q2971145) (← links)
- Clique partitioning of interval graphs with submodular costs on the cliques (Q3004202) (← links)
- Minimum Entropy Combinatorial Optimization Problems (Q3576040) (← links)
- Maximum weight<i>k</i>-independent set problem on permutation graphs (Q4467342) (← links)
- Approximation results for the optimum cost chromatic partition problem (Q4572001) (← links)
- Heterogeneous Multi-resource Allocation with Subset Demand Requests (Q5057984) (← links)
- Approximation algorithms for maximum weight <i>k</i>-coverings of graphs by packings (Q5063275) (← links)
- On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs (Q5081783) (← links)
