Computing the cutwidth of bipartite permutation graphs in linear time
DOI10.1137/110830514zbMATH Open1256.05213OpenAlexW1973196832MaRDI QIDQ4899040FDOQ4899040
Jesper Nederlof, Daniel Lokshtanov, Pinar Heggernes, Pim Van 't Hof
Publication date: 4 January 2013
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/110830514
Recommendations
- Computing the cutwidth of bipartite permutation graphs in linear time
- Cutwidth of split graphs and threshold graphs
- Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs
- Bandwidth of bipartite permutation graphs in polynomial time
- Bandwidth of Bipartite Permutation Graphs in Polynomial Time
Permutations, words, matrices (05A05) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cited In (12)
- Cutwidth: obstructions and algorithmic aspects
- A polynomial algorithm for recognizing bounded cutwidth in hypergraphs
- Title not available (Why is that?)
- Bandwidth of bipartite permutation graphs in polynomial time
- The cutwidth of trees with diameters at most 4
- Strong SDP based bounds on the cutwidth of a graph
- Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs
- Vertex deletion into bipartite permutation graphs
- Bandwidth of Bipartite Permutation Graphs in Polynomial Time
- Title not available (Why is that?)
- Algorithms for maximum internal spanning tree problem for some graph classes
- Vertex deletion into bipartite permutation graphs
This page was built for publication: Computing the cutwidth of bipartite permutation graphs in linear time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4899040)
