Pages that link to "Item:Q2872097"
From MaRDI portal
The following pages link to Exact Algorithms for Maximum Independent Set (Q2872097):
Displaying 34 items.
- The \textsc{max quasi-independent set} problem (Q434194) (← links)
- A general reduction theorem with applications to pathwidth and the complexity of Max 2-CSP (Q494789) (← links)
- Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems (Q507444) (← links)
- Fast local search for the maximum independent set problem (Q519101) (← links)
- On sequential heuristic methods for the maximum independent set problem (Q521760) (← links)
- On the maximum independent set problem in graphs of bounded maximum degree (Q778157) (← links)
- An exact algorithm for maximum independent set in degree-5 graphs (Q896662) (← links)
- Branch-and-reduce exponential/FPT algorithms in practice: a case study of vertex cover (Q897878) (← links)
- A refined algorithm for maximum independent set in degree-4 graphs (Q1680494) (← links)
- A new decomposition technique for maximal clique enumeration for sparse graphs (Q1740688) (← links)
- Exact exponential algorithms for 3-machine flowshop scheduling problems (Q1743653) (← links)
- The generalized independent set problem: polyhedral analysis and solution approaches (Q1753398) (← links)
- Exact algorithms for maximum independent set (Q2013558) (← links)
- Maximum independent sets near the upper bound (Q2026337) (← links)
- A note on the fine-grained complexity of MIS on regular graphs (Q2032165) (← links)
- An improved exact algorithm for undirected feedback vertex set (Q2355979) (← links)
- Faster exact algorithms for some terminal set problems (Q2361353) (← links)
- Finding near-optimal independent sets at scale (Q2401330) (← links)
- Fast algorithms for max independent set (Q2428670) (← links)
- Efficient exact algorithms through enumerating maximal independent sets and other techniques (Q2464327) (← links)
- On the Complexity Landscape of the Domination Chain (Q2795935) (← links)
- A fine-grained analysis of a simple independent set algorithm (Q2920136) (← links)
- Large Induced Subgraphs via Triangulations and CMSO (Q2954371) (← links)
- A Polynomial-Space Exact Algorithm for TSP in Degree-6 Graphs (Q2958106) (← links)
- Recoverable Values for Independent Sets (Q3012827) (← links)
- Faster Computation of the Maximum Dissociation Set and Minimum 3-Path Vertex Cover in Graphs (Q3452575) (← links)
- On the Equivalence among Problems of Bounded Width (Q3452838) (← links)
- A Bottom-Up Method and Fast Algorithms for max independent set (Q3569879) (← links)
- Constructing concrete hard instances of the maximum independent set problem (Q5149679) (← links)
- Listing Maximal Independent Sets with Minimal Space and Bounded Delay (Q5150928) (← links)
- An Exact Algorithm for Maximum Independent Set in Degree-5 Graphs (Q5405918) (← links)
- When polynomial approximation meets exact computation (Q5892165) (← links)
- When polynomial approximation meets exact computation (Q5915964) (← links)
- Targeted Branching for the Maximum Independent Set Problem (Q6159907) (← links)
