Pages that link to "Item:Q1183338"
From MaRDI portal
The following pages link to Computing independent sets in graphs with large girth (Q1183338):
Displaying 50 items.
- Astral graphs (threshold graphs), scale-free graphs and related algorithmic questions (Q414467) (← links)
- Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number (Q450563) (← links)
- On minimum maximal distance-\(k\) matchings (Q509288) (← links)
- Critical hereditary graph classes: a survey (Q518125) (← links)
- On graphs without a \(C_{4}\) or a diamond (Q531598) (← links)
- Boundary properties of graphs for algorithmic graph problems (Q551178) (← links)
- Stability preserving transformations of graphs (Q646718) (← links)
- Maximum regular induced subgraphs in \(2P_3\)-free graphs (Q690473) (← links)
- Upper domination: towards a dichotomy through boundary properties (Q722525) (← links)
- Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs (Q867854) (← links)
- New applications of clique separator decomposition for the maximum weight stable set problem (Q868954) (← links)
- Weighted independent sets in a subclass of \(P_6\)-free graphs (Q906493) (← links)
- A note on the greedy algorithm for finding independent sets of \(C_k\)-free graphs (Q987802) (← links)
- Stable sets in \(k\)-colorable \(P_{5}\)-free graphs (Q990082) (← links)
- Finding augmenting chains in extensions of claw-free graphs (Q1007635) (← links)
- The maximum clique problem (Q1318271) (← links)
- Stable sets in two subclasses of banner-free graphs (Q1414588) (← links)
- Improved FPT algorithms for weighted independent set in bull-free graphs (Q1685998) (← links)
- Boundary classes of graphs for the dominating set problem (Q1877644) (← links)
- Edge density and independence ratio in triangle-free graphs with maximum degree three (Q1917491) (← links)
- On the maximum independent set problem in subclasses of subcubic graphs (Q2018543) (← links)
- Independent sets in \((P_4+P_4\),triangle)-free graphs (Q2053685) (← links)
- New results on independent sets in extensions of \(2K_2\)-free graphs (Q2159731) (← links)
- On the complexity of the independent set problem in triangle graphs (Q2275391) (← links)
- The complexity of dissociation set problems in graphs (Q2275943) (← links)
- Domination, coloring and stability in \(P_5\)-reducible graphs (Q2341757) (← links)
- Extending the MAX algorithm for maximum independent set (Q2344024) (← links)
- Large independent sets in regular graphs of large girth (Q2384807) (← links)
- From matchings to independent sets (Q2403787) (← links)
- Distance-\(d\) independent set problems for bipartite and chordal graphs (Q2436655) (← links)
- On relating edges in graphs without cycles of length 4 (Q2447533) (← links)
- Fourier analysis and large independent sets in powers of complete graphs (Q2464160) (← links)
- NP-hard graph problems and boundary classes of graphs (Q2465640) (← links)
- On the \(d\)-claw vertex deletion problem (Q2695329) (← links)
- Computing \(k\)-independent sets for regular bipartite graphs (Q2717906) (← links)
- A Boundary Property for Upper Domination (Q2819507) (← links)
- On Complexity of Total Vertex Cover on Subcubic Graphs (Q2988847) (← links)
- Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes (Q3000488) (← links)
- Boundary Classes of Planar Graphs (Q3512606) (← links)
- Randomized Greedy Algorithms for Independent Sets and Matchings in Regular Graphs: Exact Results and Finite Girth Corrections (Q3557525) (← links)
- The Maximum Independent Set Problem in Planar Graphs (Q3599118) (← links)
- Complexity and Polynomially Solvable Special Cases of QUBO (Q5050143) (← links)
- On the complexity of approximating the independent set problem (Q5096160) (← links)
- The impact of the growth rate of the packing number of graphs on the computational complexity of the independent set problem (Q5249786) (← links)
- (Q5298912) (← links)
- (Q5874491) (← links)
- (Q5875468) (← links)
- Computing maximum independent set on outerstring graphs and their relatives (Q5918655) (← links)
- Maximum independent sets in subcubic graphs: new results (Q5919020) (← links)
- On a countable family of boundary graph classes for the dominating set problem (Q6054225) (← links)
