Pages that link to "Item:Q2942405"
From MaRDI portal
The following pages link to Algorithms for the Maximum Weight Connected $$k$$-Induced Subgraph Problem (Q2942405):
Displaying 9 items.
- Efficient algorithms with performance guarantees for some problems of finding several discrete disjoint subgraphs in complete weighted graph (Q299417) (← links)
- Reoptimization of maximum weight induced hereditary subgraph problems (Q386899) (← links)
- A robust and scalable algorithm for the Steiner problem in graphs (Q1646683) (← links)
- The maximum happy induced subgraph problem: bounds and algorithms (Q2026981) (← links)
- (Q4248932) (← links)
- (Q4369618) (← links)
- Combining NP-Hard Reduction Techniques and Strong Heuristics in an Exact Algorithm for the Maximum-Weight Connected Subgraph Problem (Q4620424) (← links)
- The Maximum Weight Connected Subgraph Problem (Q5265172) (← links)
- LATIN 2004: Theoretical Informatics (Q5901641) (← links)