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 8 items.
- 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)
- Subexponential-time algorithms for finding large induced sparse subgraphs (Q2041989) (← links)
- Compositional properties of alignments (Q2071523) (← links)
- Solving target set selection with bounded thresholds faster than \(2^n\) (Q2684482) (← links)
- Large Induced Subgraphs via Triangulations and CMSO (Q2954371) (← links)
- Solving Target Set Selection with Bounded Thresholds Faster than 2^n (Q5009485) (← links)
