Pages that link to "Item:Q3092237"
From MaRDI portal
The following pages link to Exact Algorithm for the Maximum Induced Planar Subgraph Problem (Q3092237):
Displaying 17 items.
- Fast partitioning \(l\)-apex graphs with applications to approximating maximum induced-subgraph problems (Q287003) (← links)
- Largest chordal and interval subgraphs faster than \(2^n\) (Q329301) (← links)
- Solving the 2-disjoint connected subgraphs problem faster than \(2^n\) (Q486988) (← links)
- Scheduling partially ordered jobs faster than \(2^n\) (Q528859) (← links)
- Algorithms for finding an induced cycle in planar graphs (Q653839) (← links)
- The maximum happy induced subgraph problem: bounds and algorithms (Q2026981) (← links)
- Subexponential-time algorithms for finding large induced sparse subgraphs (Q2041989) (← links)
- Compositional properties of alignments (Q2071523) (← links)
- On maximum planar induced subgraphs (Q2500525) (← links)
- Solving target set selection with bounded thresholds faster than \(2^n\) (Q2684482) (← links)
- Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs (Q2864316) (← links)
- Large Induced Subgraphs via Triangulations and CMSO (Q2954371) (← links)
- Solving Target Set Selection with Bounded Thresholds Faster than 2^n (Q5009485) (← links)
- A Linear-Time Algorithm for Finding Induced Planar Subgraphs (Q5140735) (← links)
- Planar Induced Subgraphs of Sparse Graphs (Q5250134) (← links)
- Quasipolynomiality of the Smallest Missing Induced Subgraph (Q6051910) (← links)
- Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion (Q6670351) (← links)