The following pages link to (Q3395987):
Displayed 12 items.
- Exact algorithms for dominating set (Q411862) (← links)
- Determining a singleton attractor of an AND/OR Boolean network in \(O(n^{1.587})\) time (Q765479) (← links)
- Solving connected dominating set faster than \(2^n\) (Q958203) (← links)
- On solving sparse algebraic equations over finite fields (Q1009070) (← links)
- On two techniques of combining branching and treewidth (Q1022343) (← links)
- Exact algorithms for edge domination (Q1945174) (← links)
- Improved agreeing-gluing algorithm (Q2254079) (← links)
- Treewidth computation and extremal combinatorics (Q2392037) (← links)
- A combinatorial problem related to sparse systems of equations (Q2402975) (← links)
- Sparse Boolean equations and circuit lattices (Q2430703) (← links)
- An exact algorithm for the minimum dominating clique problem (Q2456374) (← links)
- Exact Algorithms for Edge Domination (Q3503591) (← links)