Bandwidth on AT-free graphs
type: Item
instance of: scholarly article
title: Bandwidth on AT-free graphs
zbMATH Open document ID: 1228.68036
author: Petr A. Golovach
author: Pinar Heggernes
author: Dieter Kratsch
author: Daniel Lokshtanov
author: Daniel Meister
author: Saket Saurabh
published in: Theoretical Computer Science
publication date: 2011-12-07T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 05C78
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 5987017
zbMATH Keywords: algorithm
zbMATH Keywords: fixed-parameter tractable
zbMATH Keywords: bandwidth
zbMATH Keywords: AT-free graph
describes a project that uses: symrcm
MaRDI profile type: Publication
full work available at URL: j.tcs.2011.09.011
OpenAlex ID: W1965845491
cites work: The Bandwidth of Caterpillars with Hairs of Length 1 and 2
cites work: Beyond NP-completeness for problems of bounded width: hardness for the W hierarchy (extended abstract)
cites work: Graph Classes: A Survey
cites work: Asteroidal Triple-Free Graphs
cites work: Exact and Approximate Bandwidth
cites work: Q4393480
cites work: Linear discrepancy and bandwidth
cites work: Q4198056
cites work: Q3664299
cites work: Parametrized complexity theory.
cites work: Bandwidth of bipartite permutation graphs in polynomial time
cites work: Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques
cites work: Computing the Bandwidth of Interval Graphs
cites work: Q2766686
cites work: Approximating the Bandwidth for Asteroidal Triple-Free Graphs
cites work: Optimal greedy algorithms for indifference graphs
cites work: Triangulating graphs without asteroidal triples
cites work: The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete
cites work: Q5710169
cites work: An optimal greedy heuristic to color interval graphs
cites work: The NP-completeness of the bandwidth minimization problem
cites work: Dynamic-Programming Algorithms for Recognizing Small-Bandwidth Graphs in Polynomial Time
cites work: Q3839788
DOI: 10.1016/J.TCS.2011.09.011
Recommended article: Bandwidth on AT-Free Graphs
Recommended article: Q3328586
Recommended article: On bandwidth-2 graphs
Recommended article: Bounding the bandwidths for graphs
Recommended article: Q4940077
Recommended article: Bandwidth of chain graphs
Recommended article: On the size of graphs of a given bandwidth
Recommended article: The Bandwidth Theorem in sparse graphs
Recommended article: The bandwidth problem and operations on graphs
Recommended article: Q3744198
description: scientific article; zbMATH DE number 5987017