U-bubble model for mixed unit interval graphs and its applications: the MaxCut problem revisited
From MaRDI portal
Publication:2067672
Recommendations
- U-bubble model for mixed unit interval graphs and its applications: the MaxCut problem revisited
- On the maximum cardinality cut problem in proper interval graphs and related graph classes
- SIMPLE MAX-CUT for unit interval graphs and graphs with few P4s
- The \(p\)-Maxian problem on interval graphs
- \textsc{max-cut} and containment relations in graphs
- scientific article; zbMATH DE number 7765394
- Length-bounded cuts: proper interval graphs and structural parameters
- A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs
- The maximum clique problem in multiple interval graphs (extended abstract)
- On graphs of the cone decompositions for the min-cut and max-cut problems
Cites work
- A new representation of proper interval graphs with an application to clique-width
- A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs
- Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width
- Broadcast chromatic numbers of graphs
- Clique-width is NP-complete
- Clique-width minimization is NP-hard
- Clique-width of full bubble model graphs
- Finding Hamiltonian circuits in interval graphs
- Graph Classes: A Survey
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3706451 (Why is no real title available?)
- scientific article; zbMATH DE number 3307330 (Why is no real title available?)
- Integral mixed unit interval graphs
- Labeling Chordal Graphs: Distance Two Condition
- Labelling Graphs with a Condition at Distance 2
- Linear time solvable optimization problems on graphs of bounded clique-width
- Minimal classes of graphs of unbounded clique-width
- Mixed unit interval graphs
- Notes on complexity of packing coloring
- On the clique-width of some perfect graph classes
- Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques
- SIMPLE MAX-CUT for unit interval graphs and graphs with few P4s
- Subexponential algorithms for unique games and related problems
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- The maximum cardinality cut problem in co-bipartite chain graphs
- The Roberts characterization of proper and unit interval graphs
- U-bubble model for mixed unit interval graphs and its applications: the MaxCut problem revisited
- Unit interval graphs of open and closed intervals
- Unit mixed interval graphs
- Upper bounds to the clique width of graphs
Cited in
(7)- On the maximum cardinality cut problem in proper interval graphs and related graph classes
- SIMPLE MAX-CUT for unit interval graphs and graphs with few P4s
- U-bubble model for mixed unit interval graphs and its applications: the MaxCut problem revisited
- Tuza's Conjecture for Threshold Graphs
- Efficient non-isomorphic graph enumeration algorithms for several intersection graph classes
- Graphs with at most two moplexes
- Semi-proper interval graphs
This page was built for publication: \(\mathcal{U}\)-bubble model for mixed unit interval graphs and its applications: the MaxCut problem revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2067672)
