Pages that link to "Item:Q4435347"
From MaRDI portal
The following pages link to Small Maximal Independent Sets and Faster Exact Graph Coloring (Q4435347):
Displayed 13 items.
- Minimal dominating sets in graph classes: combinatorial bounds and enumeration (Q387008) (← links)
- Branch and recharge: exact algorithms for generalized domination (Q639293) (← links)
- New plain-exponential time classes for graph homomorphism (Q639844) (← links)
- Enumerating maximal independent sets with applications to graph colouring. (Q703280) (← links)
- Exact algorithms for exact satisfiability and number of perfect matchings (Q958212) (← links)
- Graph coloring by multiagent fusion search (Q1037448) (← links)
- Trimmed Moebius inversion and graphs of bounded degree (Q1959390) (← links)
- Determining the \(L(2,1)\)-span in polynomial space (Q2446848) (← links)
- The parameterized complexity of maximality and minimality problems (Q2470035) (← links)
- Minimal Dominating Sets in Graph Classes: Combinatorial Bounds and Enumeration (Q2891369) (← links)
- New Plain-Exponential Time Classes for Graph Homomorphism (Q3392969) (← links)
- On the number of maximal bipartite subgraphs of a graph (Q4667793) (← links)
- Feedback Vertex Sets in Tournaments (Q4908824) (← links)