Pages that link to "Item:Q4630247"
From MaRDI portal
The following pages link to The approximation of maximum subgraph problems (Q4630247):
Displayed 11 items.
- Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization (Q856420) (← links)
- Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties (Q955347) (← links)
- An improved algorithm for the longest induced path problem on \(k\)-chordal graphs (Q1005252) (← links)
- A unified approximation algorithm for node-deletion problems (Q1270821) (← links)
- Finding optimal subgraphs by local search (Q1392027) (← links)
- Domination analysis of combinatorial optimization problems. (Q1406045) (← links)
- Local approximations for maximum partial subgraph problem. (Q1426723) (← links)
- Approximating minimum feedback vertex sets in hypergraphs (Q1583598) (← links)
- On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs (Q5900085) (← links)
- A generalization of maximal independent sets (Q5931790) (← links)
- Complexity classification of some edge modification problems (Q5948964) (← links)