Maximum bipartite subgraphs of geometric intersection graphs
From MaRDI portal
Publication:6552516
Recommendations
Cites work
- A linear time algorithm to compute a maximum weighted independent set on cocomparability graphs
- A linear-time algorithm for the weighted feedback vertex problem on interval graphs
- A polynomial algorithm to find an independent set of maximum weight in a fork-free graph
- Algorithms – ESA 2005
- An Efficient Test for Circular-Arc Graphs
- Approximation schemes for covering and packing problems in image processing and VLSI
- Comments on F. Hadlock’s Paper: “Finding a Maximum Cut of a Planar Graph in Polynomial Time”
- Computing maximum independent set on outerstring graphs and their relatives
- Faster approximation for maximum independent set on unit disk graph
- Feedback vertex set on AT-free graphs
- Finding a Maximum Cut of a Planar Graph in Polynomial Time
- Finding a maximum-weight induced \(k\)-partite subgraph of an \(i\)-triangulated graph
- Finding odd cycle transversals.
- Graph Bipartization and via minimization
- scientific article; zbMATH DE number 4200260 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 512913 (Why is no real title available?)
- scientific article; zbMATH DE number 1507300 (Why is no real title available?)
- Label placement by maximum independent set in rectangles
- Maximum bipartite subgraph of geometric intersection graphs
- Maximum independent and disjoint coverage
- Maximum independent set of rectangles
- Maximum independent set on \(B_1\)-VPG graphs
- Maximum weighted induced bipartite subgraphs and acyclic subgraphs of planar cubic graphs
- Minimum feedback vertex sets in cocomparability graphs and complex bipartite graphs
- Node-and edge-deletion NP-complete problems
- Node-Deletion Problems on Bipartite Graphs
- On chain and antichain families of a partially ordered set
- On cycle transversals and their connected variants in the absence of a small linear forest
- On rectangle intersection and overlap graphs
- Parameterized algorithms for (r,l)-partization
- Parameterized Complexity of Independence and Domination on Geometric Graphs
- Polynomial-time algorithm for maximum weight independent set on \(P_6\)-free graphs
- Polynomial-time approximation schemes for packing and piercing fat objects
- Simpler parameterized algorithm for OCT
- Stability in circular arc graphs
- Subexponential parameterized odd cycle transversal on planar graphs
- The exponential time hypothesis and the parameterized clique problem
- The Maximum Induced Bipartite Subgraph Problem with Edge Weights
- The maximum k-colorable subgraph problem for chordal graphs
- The node-deletion problem for hereditary properties is NP-complete
- Unit disk graphs
This page was built for publication: Maximum bipartite subgraphs of geometric intersection graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6552516)
