The following pages link to Exact exponential algorithms. (Q606873):
Displaying 50 items.
- An improved exact algorithm for TSP in graphs of maximum degree 4 (Q255262) (← links)
- Exact algorithms for intervalizing coloured graphs (Q255264) (← links)
- A fast branching algorithm for cluster vertex deletion (Q255285) (← links)
- Algorithms and almost tight results for 3-colorability of small diameter graphs (Q261372) (← links)
- An exact algorithm for TSP in degree-3 graphs via circuit procedure and amortization on connectivity structure (Q262259) (← links)
- Enumerating minimal connected dominating sets in graphs of bounded chordality (Q278724) (← links)
- A fast algorithm for permutation pattern matching based on alternating runs (Q300457) (← links)
- Computing directed pathwidth in \(O(1.89^n)\) time (Q300464) (← links)
- An \(O^*(1.4366^n)\)-time exact algorithm for maximum \(P_2\)-packing in cubic graphs (Q306106) (← links)
- On the parameterised complexity of string morphism problems (Q315525) (← links)
- Largest chordal and interval subgraphs faster than \(2^n\) (Q329301) (← links)
- Parameterized algorithms for non-separating trees and branchings in digraphs (Q334949) (← links)
- On the parameterized complexity of b-\textsc{chromatic number} (Q340565) (← links)
- Treewidth and pathwidth parameterized by the vertex cover number (Q344839) (← links)
- Minimal dominating sets in interval graphs and trees (Q344851) (← links)
- Minimal dominating sets in graph classes: combinatorial bounds and enumeration (Q387008) (← links)
- On an extension of the Sort \& Search method with application to scheduling theory (Q392015) (← links)
- A novel parameterised approximation algorithm for \textsc{minimum vertex cover} (Q392028) (← links)
- Fast exact algorithm for \(L(2,1)\)-labeling of graphs (Q393134) (← links)
- Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms (Q411835) (← links)
- Bicolored independent sets and bicliques (Q436317) (← links)
- An exact exponential-time algorithm for the directed maximum leaf spanning tree problem (Q450578) (← links)
- Guarantees and limits of preprocessing in constraint satisfaction and reasoning (Q460604) (← links)
- Enumerating minimal subset feedback vertex sets (Q472481) (← links)
- Exact algorithms for Kayles (Q476858) (← links)
- On the number of minimal dominating sets on some graph classes (Q476916) (← links)
- Solving the 2-disjoint connected subgraphs problem faster than \(2^n\) (Q486988) (← links)
- A general reduction theorem with applications to pathwidth and the complexity of Max 2-CSP (Q494789) (← links)
- Parameterized algorithms for the 2-clustering problem with minimum sum and minimum sum of squares objective functions (Q494805) (← links)
- On finding optimal polytrees (Q500966) (← links)
- Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems (Q507444) (← links)
- On optimal approximability results for computing the strong metric dimension (Q512531) (← links)
- Exact algorithms for minimum weighted dominating induced matching (Q521800) (← links)
- Scheduling partially ordered jobs faster than \(2^n\) (Q528859) (← links)
- An exact algorithm for minimum distortion embedding (Q551173) (← links)
- Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack (Q635734) (← links)
- On computing the minimum 3-path vertex cover and dissociation number of graphs (Q650941) (← links)
- An exact algorithm for the maximum leaf spanning tree problem (Q653320) (← links)
- Edge bipartization faster than \(2^k\) (Q666655) (← links)
- Stable matching games: manipulation via subgraph isomorphism (Q722540) (← links)
- Enumerating minimal dominating sets in chordal graphs (Q738877) (← links)
- Dual parameterization of weighted coloring (Q786042) (← links)
- An improved upper bound for SAT (Q820534) (← links)
- Algorithmic analysis of priority-based bin packing (Q831745) (← links)
- An exact algorithm for maximum independent set in degree-5 graphs (Q896662) (← links)
- Algorithms solving the matching cut problem (Q897900) (← links)
- Moderately exponential time algorithms for the maximum bounded-degree-1 set problem (Q1627852) (← links)
- Enumeration of maximal irredundant sets for claw-free graphs (Q1628586) (← links)
- Parameterizing edge modification problems above lower bounds (Q1635817) (← links)
- Problems on finite automata and the exponential time hypothesis (Q1662614) (← links)
