The following pages link to (Q2741323):
Displaying 7 items.
- A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs (Q509888) (← links)
- Canonical antichains of unit interval and bipartite permutation graphs (Q651422) (← links)
- Minimal classes of graphs of unbounded clique-width (Q659655) (← links)
- A Lex-BFS-based recognition algorithm for Robinsonian matrices (Q1786881) (← links)
- On the maximum cardinality cut problem in proper interval graphs and related graph classes (Q2055967) (← links)
- \(\mathcal{U}\)-bubble model for mixed unit interval graphs and its applications: the MaxCut problem revisited (Q2067672) (← links)
- (Q5089227) (← links)
