Pages that link to "Item:Q4074668"
From MaRDI portal
The following pages link to Vertex packings: Structural properties and algorithms (Q4074668):
Displaying 30 items.
- The Clique Corona Operation and Greedoids (Q5505676) (← links)
- (Q5743380) (← links)
- (Q5743381) (← links)
- Exploiting c-Closure in Kernelization Algorithms for Graph Problems (Q5874537) (← links)
- Parameterized complexity and kernelizability of max ones and exact ones problems (Q5890961) (← links)
- When polynomial approximation meets exact computation (Q5892165) (← links)
- A branch and bound algorithm for the maximum clique problem (Q5899820) (← links)
- When polynomial approximation meets exact computation (Q5915964) (← links)
- A quadratic programming approach to the determination of an upper bound on the weighted stability number (Q5939588) (← links)
- Comparison of column generation models for channel assignment in cellular networks (Q5946824) (← links)
- Finding all \(k\)-cliques in \(k\)-partite graphs, an application in textile engineering (Q5955469) (← links)
- Parameterized certificate dispersal and its variants (Q5964075) (← links)
- Approximate core allocations for edge cover games (Q6122606) (← links)
- A theoretical and computational analysis of full strong-branching (Q6126652) (← links)
- A polytime preprocess algorithm for the maximum independent set problem (Q6151535) (← links)
- Kernelization for feedback vertex set via elimination distance to a forest (Q6153475) (← links)
- Space limited linear-time graph algorithms on big data (Q6196840) (← links)
- A differentiable approach to the maximum independent set problem using dataless neural networks (Q6488722) (← links)
- The complexity of matching games: a survey (Q6488787) (← links)
- On the parallel parameterized complexity of MaxSAT variants (Q6535422) (← links)
- Approximate core allocations for edge cover games (Q6535804) (← links)
- Finding triangle-free 2-factors in general graphs (Q6540256) (← links)
- Approximation algorithm for minimum \(q\)-dominator partization problem (Q6542935) (← links)
- Parameterized approximation algorithms for weighted vertex cover (Q6547955) (← links)
- Preprocessing to reduce the search space: antler structures for feedback vertex set (Q6564613) (← links)
- Constructive -- non-constructive approximation and maximum independent set problem (Q6567680) (← links)
- Search-space reduction via essential vertices (Q6606914) (← links)
- Parameterized complexity of streaming diameter and connectivity problems (Q6614110) (← links)
- Ultimate greedy approximation of independent sets in subcubic graphs (Q6623597) (← links)
- Parameterized approximation algorithms for weighted vertex cover (Q6639732) (← links)