Pages that link to "Item:Q2464327"
From MaRDI portal
The following pages link to Efficient exact algorithms through enumerating maximal independent sets and other techniques (Q2464327):
Displayed 22 items.
- Largest chordal and interval subgraphs faster than \(2^n\) (Q329301) (← links)
- Parameterized edge dominating set in graphs with degree bounded by 3 (Q388085) (← links)
- An exponential time 2-approximation algorithm for bandwidth (Q392018) (← links)
- New parameterized algorithms for the edge dominating set problem (Q392035) (← links)
- A note on the parameterized complexity of unordered maximum tree orientation (Q427909) (← links)
- A refined exact algorithm for edge dominating set (Q477194) (← links)
- Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry (Q708383) (← links)
- On two techniques of combining branching and treewidth (Q1022343) (← links)
- Parameterized algorithms for Max Colorable Induced Subgraph problem on perfect graphs (Q1755775) (← links)
- Algorithms for dominating clique problems (Q1758169) (← links)
- Exact algorithms for edge domination (Q1945174) (← links)
- Fixed-parameter tractability results for feedback set problems in tournaments (Q2266940) (← links)
- New results on polynomial inapproximability and fixed parameter approximability of Edge Dominating Set (Q2345984) (← links)
- Improved fixed parameter tractable algorithms for two ``edge'' problems: MAXCUT and MAXDAG (Q2379999) (← links)
- Parameterized Edge Dominating Set in Cubic Graphs (Q3004660) (← links)
- Exact Algorithms for Edge Domination (Q3503591) (← links)
- Iterative Compression and Exact Algorithms (Q3599139) (← links)
- Iterative Compression for Exactly Solving NP-Hard Minimization Problems (Q3637312) (← links)
- Feedback Vertex Sets in Tournaments (Q4908824) (← links)
- (Q5090486) (← links)
- An Exact Method for the Minimum Feedback Arc Set Problem (Q5102057) (← links)
- An Efficient Fixed-Parameter Enumeration Algorithm for Weighted Edge Dominating Set (Q5321717) (← links)
