Algorithms for finding an induced cycle in planar graphs and bounded genus graphs
From MaRDI portal
(Redirected from Publication:4633929)
Recommendations
Cited in
(35)- Induced circuits in planar graphs
- Finding and listing induced paths and cycles
- Subexponential algorithms for partial cover problems
- Few induced disjoint paths for \(H\)-free graphs
- A faster algorithm to recognize even-hole-free graphs
- Irrelevant vertices for the planar disjoint paths problem
- An Improved Algorithm for Finding Cycles Through Elements
- The disjoint paths problem in quadratic time
- A linear time algorithm for the induced disjoint paths problem in planar graphs
- Algorithms for the edge-width of an embedded graph
- scientific article; zbMATH DE number 475589 (Why is no real title available?)
- Confronting intractability via parameters
- Finding disjoint paths in split graphs
- \(k\)-chordal graphs: from cops and robber to compact routing via treewidth
- Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths
- Exact Solution Algorithms for the Chordless Cycle Problem
- Induced disjoint paths in claw-free graphs
- Linear kernels for (connected) dominating set on \(H\)-minor-free graphs
- A faster algorithm to recognize even-hole-free graphs
- scientific article; zbMATH DE number 7053391 (Why is no real title available?)
- Induced disjoint paths and connected subgraphs for H-free graphs
- Induced disjoint paths and connected subgraphs for \(H\)-free graphs
- MIP formulations for induced graph optimization problems: a tutorial
- Combing a Linkage in an Annulus
- Few induced disjoint paths for \(H\)-free graphs
- Algorithms for finding an induced cycle in planar graphs
- Parameterized algorithms for list \(K\)-cycle
- Computing paths of large rank in planar frameworks deterministically
- Semidefinite programming bounds and a branch-and-bound algorithm for the chordless cycle problem
- Kernels for the disjoint paths problem on subclasses of chordal graphs
- Kernels for the disjoint paths problem on subclasses of chordal graphs
- Computing paths of large rank in planar frameworks deterministically
- Induced disjoint paths without an induced minor
- (Almost-)optimal FPT algorithm and kernel for T-cycle on planar graphs
- Induced packing of odd cycles in planar graphs
This page was built for publication: Algorithms for finding an induced cycle in planar graphs and bounded genus graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4633929)
