Pages that link to "Item:Q3004674"
From MaRDI portal
The following pages link to Two Hardness Results on Feedback Vertex Sets (Q3004674):
Displaying 22 items.
- Circular convex bipartite graphs: feedback vertex sets (Q300230) (← links)
- Performances of pure random walk algorithms on constraint satisfaction problems with growing domains (Q328683) (← links)
- Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs (Q328696) (← links)
- A general model and thresholds for random constraint satisfaction problems (Q359981) (← links)
- Feedback vertex sets on restricted bipartite graphs (Q393042) (← links)
- Counting independent sets in tree convex bipartite graphs (Q730492) (← links)
- Counting independent sets and maximal independent sets in some subclasses of bipartite graphs (Q1627864) (← links)
- The complexity of secure domination problem in graphs (Q1708386) (← links)
- Algorithmic aspects of secure connected domination in graphs (Q2042631) (← links)
- Algorithmic aspects of 2-secure domination in graphs (Q2045038) (← links)
- Large hypertree width for sparse random hypergraphs (Q2343976) (← links)
- Tractable connected domination for restricted bipartite graphs (Q2354310) (← links)
- Complete Boolean satisfiability solving algorithms based on local search (Q2434568) (← links)
- Counting dominating sets in some subclasses of bipartite graphs (Q2672635) (← links)
- Circular Convex Bipartite Graphs: Feedback Vertex Set (Q2867126) (← links)
- Union Closed Tree Convex Sets (Q3452566) (← links)
- Fractional Edge Cover Number of Model RB (Q4632176) (← links)
- Maximum Edge Bicliques in Tree Convex Bipartite Graphs (Q4632202) (← links)
- Total vertex-edge domination in graphs: Complexity and algorithms (Q5057738) (← links)
- Algorithmic aspects of certified domination in graphs (Q6101494) (← links)
- On convexity in split graphs: complexity of Steiner tree and domination (Q6123388) (← links)
- Some new algorithmic results on co-secure domination in graphs (Q6190005) (← links)
