scientific article

zbMath1038.90545MaRDI QIDQ2741323

Ton Kloks, Rolf Niedermeier, Hans L. Bodlaender

Publication date: 23 September 2001

Full work available at URL: http://www.elsevier.nl/cas/tree/store/disc/free/endm/store/contents.htt?jrnl=disc&sctn=endm&mode=sub&vol=3

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (7)

Canonical antichains of unit interval and bipartite permutation graphs ⋮ Minimal classes of graphs of unbounded clique-width ⋮ A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs ⋮ Unnamed Item ⋮ A Lex-BFS-based recognition algorithm for Robinsonian matrices ⋮ On the maximum cardinality cut problem in proper interval graphs and related graph classes ⋮ \(\mathcal{U}\)-bubble model for mixed unit interval graphs and its applications: the MaxCut problem revisited

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A polynomial characterization of some graph partitioning problems
• Classes of bipartite graphs related to chordal graphs
• On a unique tree representation for \(P_ 4\)-extendible graphs
• A tree representation for \(P_ 4\)-sparse graphs
• Some simplified NP-complete graph problems
• A short proof that `proper = unit'
• Automorphism groups of graphs with 1-factorizations
• Linear time optimization algorithms for \(P_ 4\)-sparse graphs
• Recognizing $P_4 $-Sparse Graphs in Linear Time
• Finding a Maximum Cut of a Planar Graph in Polynomial Time
• P-Components and the Homogeneous Decomposition of Graphs
• Node-and edge-deletion NP-complete problems
• A Characterization of Comparability Graphs and of Interval Graphs
• Bandwidth and topological bandwidth of graphs with few \(P_4\)'s

This page was built for publication: