Bandwidth of chain graphs
From MaRDI portal
Publication:293476
DOI10.1016/S0020-0190(98)00173-2zbMATH Open1339.05393OpenAlexW2043400700MaRDI QIDQ293476FDOQ293476
Authors: Ton Kloks, Dieter Kratsch, Haiko Müller 
Publication date: 9 June 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019098001732?np=y
Recommendations
- scientific article; zbMATH DE number 3859182
- Bounding the bandwidths for graphs
- Publication:4940077
- scientific article; zbMATH DE number 3963886
- Edge-Bandwidth of Graphs
- Bandwidth and density for block graphs
- Bandwidth theorem for random graphs
- On bandwidth sums of graphs
- scientific article; zbMATH DE number 1150205
- scientific article; zbMATH DE number 3979113
Graph algorithms (graph-theoretic aspects) (05C85) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cites Work
- Title not available (Why is that?)
- Representation of a finite graph by a set of intervals on the real line
- Node-Deletion Problems on Bipartite Graphs
- Bandwidth of theta graphs with short paths
- The NP-completeness of the bandwidth minimization problem
- Beyond NP-completeness for problems of bounded width: hardness for the W hierarchy (extended abstract)
- The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete
- Improved dynamic programming algorithms for bandwidth minimization and the MinCut Linear Arrangement problem
- Computing the Bandwidth of Interval Graphs
- The Bandwidth of Caterpillars with Hairs of Length 1 and 2
- Complexity Results for Bandwidth Minimization
- An $O( n \log n )$ Algorithm for Bandwidth of Interval Graphs
- Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques
Cited In (24)
- Roman \(\{3\}\)-domination in graphs: complexity and algorithms
- An exponential time 2-approximation algorithm for bandwidth
- Bandwidth on AT-free graphs
- Linear structure of bipartite permutation graphs and the longest path problem
- The maximum binary tree problem
- Bandwidth of bipartite permutation graphs in polynomial time
- Minimal classes of graphs of unbounded clique-width
- Title not available (Why is that?)
- Bandwidth of convex bipartite graphs and related graphs
- Algorithmic aspects of upper paired-domination in graphs
- Graph bandwidth of weighted caterpillars
- Acyclic matchings in subclasses of bipartite graphs
- Tractabilities and intractabilities on geometric intersection graphs
- Bounds on mincut for Cayley graphs over Abelian groups
- On computing longest paths in small graph classes
- Secure total domination in chain graphs and cographs
- Hardness results of connected power domination for bipartite graphs and chordal graphs
- A note on maximum differential coloring of planar graphs
- Bichain graphs: geometric model and universal graphs
- Bandwidth of Bipartite Permutation Graphs in Polynomial Time
- Hardness results of connected power domination for bipartite graphs and chordal graphs
- Bipartite graphs totally decomposable by canonical decomposition
- Permutation bigraphs and interval containments
- The Maximum Binary Tree Problem.
This page was built for publication: Bandwidth of chain graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293476)
