Pages that link to "Item:Q5716773"
From MaRDI portal
The following pages link to Automata, Languages and Programming (Q5716773):
Displaying 43 items.
- An exact algorithm for TSP in degree-3 graphs via circuit procedure and amortization on connectivity structure (Q262259) (← 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)
- Exact algorithms for dominating set (Q411862) (← links)
- Exact algorithms for \(L(2,1)\)-labeling of graphs (Q627538) (← links)
- An exact algorithm for connected red-blue dominating set (Q635737) (← links)
- Branch and recharge: exact algorithms for generalized domination (Q639293) (← links)
- On partitioning a graph into two connected subgraphs (Q650911) (← links)
- Improved upper bounds for vertex cover (Q708228) (← links)
- Improved edge-coloring with three colors (Q837164) (← links)
- An improved exact algorithm for the domatic number problem (Q845906) (← links)
- A top-down approach to search-trees: Improved algorithmics for 3-hitting set (Q848640) (← links)
- Solving connected dominating set faster than \(2^n\) (Q958203) (← links)
- Exact algorithms for exact satisfiability and number of perfect matchings (Q958212) (← links)
- On the minimum feedback vertex set problem: Exact and enumeration algorithms (Q958216) (← links)
- Finding a dominating set on bipartite graphs (Q963425) (← links)
- Parameterized algorithms for \(d\)-hitting set: the weighted case (Q964386) (← links)
- Exploiting dominance conditions for computing non trivial worst-case complexity for bounded combinatorial optimization problems (Q1001381) (← links)
- A bounded search tree algorithm for parameterized face cover (Q1002098) (← links)
- Efficiency in exponential time for domination-type problems (Q1003475) (← links)
- On two techniques of combining branching and treewidth (Q1022343) (← links)
- Pathwidth of cubic graphs and exact algorithms (Q1045933) (← links)
- Dominating sets in intersection graphs of finite groups (Q1755474) (← links)
- Inexact graph matching using a hierarchy of matching processes (Q2288126) (← links)
- Improved fixed parameter tractable algorithms for two ``edge'' problems: MAXCUT and MAXDAG (Q2379999) (← links)
- Computing optimal Steiner trees in polynomial space (Q2392926) (← links)
- An exact algorithm for the minimum dominating clique problem (Q2456374) (← links)
- Improved worst-case complexity for the MIN 3-SET COVERING problem (Q2643796) (← links)
- A Faster Algorithm for Dominating Set Analyzed by the Potential Method (Q2891336) (← links)
- Turbo-Charging Dominating Set with an FPT Subroutine: Further Improvements and Experimental Analysis (Q2988810) (← links)
- Fast Exact Algorithm for L(2,1)-Labeling of Graphs (Q3010388) (← links)
- Counting Independent Sets in Claw-Free Graphs (Q3104779) (← links)
- A measure & conquer approach for the analysis of exact algorithms (Q3452221) (← links)
- A Moderately Exponential Time Algorithm for Full Degree Spanning Tree (Q3502671) (← links)
- Exact Algorithms for Edge Domination (Q3503591) (← links)
- Faster Steiner Tree Computation in Polynomial-Space (Q3541105) (← links)
- Moderately Exponential Approximation: Bridging the Gap Between Exact Computation and Polynomial Approximation (Q4596147) (← links)
- On Independent Sets and Bicliques in Graphs (Q5302053) (← links)
- Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs (Q5452161) (← links)
- Quasiconvex Analysis of Backtracking Algorithms (Q5501340) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5710806) (← links)
- When polynomial approximation meets exact computation (Q5892165) (← links)
- When polynomial approximation meets exact computation (Q5915964) (← links)