Pages that link to "Item:Q5741738"
From MaRDI portal
The following pages link to A Simple Algorithm for the Graph Minor Decomposition − Logic meets Structural Graph Theory– (Q5741738):
Displaying 10 items.
- The parameterized complexity of \(k\)-edge induced subgraphs (Q729817) (← links)
- Polynomial bounds for centered colorings on proper minor-closed graph classes (Q1984513) (← links)
- Simple PTAS's for families of graphs excluding a minor (Q2352263) (← links)
- An algorithm for reading dependencies from the minimal undirected independence map of a graphoid that satisfies weak transitivity (Q2880919) (← links)
- Linear Time Parameterized Algorithms for Subset Feedback Vertex Set (Q3448850) (← links)
- Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths (Q5042453) (← links)
- A Linear-Time Parameterized Algorithm for Node Unique Label Cover (Q5111746) (← links)
- Structure Theorem and Isomorphism Test for Graphs with Excluded Topological Subgraphs (Q5252660) (← links)
- Computing with tangles (Q5890774) (← links)
- Approximating sparse quadratic programs (Q6180751) (← links)
