Pages that link to "Item:Q4630247"
From MaRDI portal
The following pages link to The approximation of maximum subgraph problems (Q4630247):
Displaying 12 items.
- On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs (Q5901067) (← links)
- Efficient algorithms for measuring the funnel-likeness of DAGs (Q5915704) (← links)
- Advice complexity of priority algorithms (Q5916086) (← links)
- A generalization of maximal independent sets (Q5931790) (← links)
- Complexity classification of some edge modification problems (Q5948964) (← links)
- Structure in approximation classes (Q6085751) (← links)
- Drawing Order Diagrams Through Two-Dimension Extension (Q6181952) (← links)
- On the \(d\)-claw vertex deletion problem (Q6182678) (← links)
- An improved algorithm for finding maximum outerplanar subgraphs (Q6184327) (← links)
- Constant ratio approximations of the weighted feedback vertex set problem for undirected graphs (Q6487955) (← links)
- String editing under pattern constraints (Q6646447) (← links)
- A constant-factor approximation for weighted bond cover (Q6671673) (← links)