Pages that link to "Item:Q820151"
From MaRDI portal
The following pages link to Parameterized graph separation problems (Q820151):
Displaying 50 items.
- What’s Next? Future Directions in Parameterized Complexity (Q2908548) (← links)
- Clique Cover and Graph Separation (Q2943572) (← links)
- How to Cut a Graph into Many Pieces (Q3010400) (← links)
- Subset Feedback Vertex Set Is Fixed-Parameter Tractable (Q3012825) (← links)
- Clustering with Local Restrictions (Q3012850) (← links)
- Important Separators and Parameterized Algorithms (Q3104759) (← links)
- Treewidth reduction for constrained separation and bipartization problems (Q3113780) (← links)
- A Faster Parameterized Algorithm for Group Feedback Edge Set (Q3181064) (← links)
- Designing FPT Algorithms for Cut Problems Using Randomized Contractions (Q3187169) (← links)
- Odd Multiway Cut in Directed Acyclic Graphs (Q3300762) (← links)
- Linear Time Parameterized Algorithms for Subset Feedback Vertex Set (Q3448850) (← links)
- FPT Algorithms for Path-Transversals and Cycle-Transversals Problems in Graphs (Q3503584) (← links)
- Algorithms for Multiterminal Cuts (Q3503649) (← links)
- An approach to emulating separable graphs (Q4277376) (← links)
- Covering Vectors by Spaces: Regular Matroids (Q4555045) (← links)
- Multicut Is FPT (Q4605273) (← links)
- Minimum Bisection Is Fixed-Parameter Tractable (Q4634024) (← links)
- (Q5002776) (← links)
- (Q5002797) (← links)
- Multi-Budgeted Directed Cuts (Q5009480) (← links)
- (Q5009483) (← links)
- Solving Target Set Selection with Bounded Thresholds Faster than 2^n (Q5009485) (← links)
- (Q5089231) (← links)
- Quick separation in chordal and split graphs (Q5089243) (← links)
- (Q5089249) (← links)
- (Q5091155) (← links)
- (Q5091216) (← links)
- (Q5092387) (← links)
- A Linear-Time Parameterized Algorithm for Node Unique Label Cover (Q5111746) (← links)
- (Q5111755) (← links)
- (Q5111877) (← links)
- Balanced Judicious Bipartition is Fixed-Parameter Tractable (Q5136332) (← links)
- Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes (Q5150814) (← links)
- Balanced Judicious Bipartition is Fixed-Parameter Tractable (Q5238741) (← links)
- Structure Theorem and Isomorphism Test for Graphs with Excluded Topological Subgraphs (Q5252660) (← links)
- Parameterized and Exact Computation (Q5311527) (← links)
- Graph-Based Representations in Pattern Recognition (Q5316491) (← links)
- Hitting Selected (Odd) Cycles (Q5348214) (← links)
- Computation in Causal Graphs (Q5377356) (← links)
- (Q5743380) (← links)
- (Q5743512) (← links)
- Hypergraph <i>k</i>-Cut for Fixed <i>k</i> in Deterministic Polynomial Time (Q5870380) (← links)
- Approximating small balanced vertex separators in almost linear time (Q5919618) (← links)
- Finding \(k\)-secluded trees faster (Q6039423) (← links)
- Some results on connected vertex separators (Q6040587) (← links)
- Parameterized complexity of multicut in weighted trees (Q6050131) (← links)
- The firebreak problem (Q6065343) (← links)
- (Q6089665) (← links)
- Fission: Practical algorithms for computing minimum balanced node separators (Q6115756) (← links)
- Deletion to scattered graph classes. I: Case of finite number of graph classes (Q6133645) (← links)