Pages that link to "Item:Q1045933"
From MaRDI portal
The following pages link to Pathwidth of cubic graphs and exact algorithms (Q1045933):
Displayed 31 items.
- Variable neighborhood search for the vertex separation problem (Q339678) (← links)
- The \textsc{max quasi-independent set} problem (Q434194) (← links)
- Efficient algorithms for the \textsc{max~\(k\)-vertex cover problem} (Q489714) (← links)
- A general reduction theorem with applications to pathwidth and the complexity of Max 2-CSP (Q494789) (← links)
- Improved edge-coloring with three colors (Q837164) (← links)
- An exact algorithm for maximum independent set in degree-5 graphs (Q896662) (← links)
- A faster polynomial-space algorithm for Max 2-CSP (Q899585) (← links)
- Exact algorithms for exact satisfiability and number of perfect matchings (Q958212) (← links)
- Finding a dominating set on bipartite graphs (Q963425) (← links)
- Exploiting dominance conditions for computing non trivial worst-case complexity for bounded combinatorial optimization problems (Q1001381) (← links)
- On two techniques of combining branching and treewidth (Q1022343) (← links)
- Faster computation of maximum independent set and parameterized vertex cover for graphs with maximum degree 3 (Q1026228) (← links)
- A refined algorithm for maximum independent set in degree-4 graphs (Q1680494) (← links)
- Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem (Q1683124) (← links)
- The many facets of upper domination (Q1704853) (← links)
- Finding and counting permutations via CSPs (Q2041985) (← links)
- Colorings with few colors: counting, enumeration and combinatorial bounds (Q2392249) (← links)
- Linear-programming design and analysis of fast algorithms for Max 2-CSP (Q2427689) (← links)
- Fast algorithms for max independent set (Q2428670) (← links)
- Improved worst-case complexity for the MIN 3-SET COVERING problem (Q2643796) (← links)
- Determining the circular flow number of a cubic graph (Q2656904) (← links)
- Algorithmic Aspects of Upper Domination: A Parameterised Perspective (Q2830063) (← links)
- Counting Maximal Independent Sets in Subcubic Graphs (Q2891379) (← links)
- Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds (Q3057611) (← links)
- Separate, Measure and Conquer: Faster Polynomial-Space Algorithms for Max 2-CSP and Counting Dominating Sets (Q3448816) (← links)
- An O *(1.0977 n ) Exact Algorithm for max independent set in Sparse Graphs (Q3503578) (← links)
- Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms (Q3656854) (← links)
- Four Shorts Stories on Surprising Algorithmic Uses of Treewidth (Q5042454) (← links)
- (Q5090992) (← links)
- Improving TSP Tours Using Dynamic Programming over Tree Decompositions. (Q5111717) (← links)
- Faster graph coloring in polynomial space (Q5925619) (← links)