Approximating the Bandwidth for Asteroidal Triple-Free Graphs
type: Item
instance of: scholarly article
title: Approximating the Bandwidth for Asteroidal Triple-Free Graphs
zbMATH Open document ID: 0951.68113
author: Ton Kloks
author: Dieter Kratsch
author: Haiko Müller
published in: Journal of Algorithms
publication date: 2000-12-18T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 1383716
zbMATH Keywords: bandwidth minimization problem
zbMATH Keywords: AT-free graph
MaRDI profile type: Publication
full work available at URL: jagm.1998.0997
OpenAlex ID: W2062004151
DOI: 10.1006/JAGM.1998.0997
Recommended article: Approximating the bandwidth for asteroidal triple-free graphs
Recommended article: On treewidth and minimum fill-in of asteroidal triple-free graphs
Recommended article: Q5197590
Recommended article: Asteroidal Triple-Free Graphs
Recommended article: Asteroidal triple-free graphs
Recommended article: Bounding the bandwidths for graphs
Recommended article: Linear time algorithms for dominating pairs in asteroidal triple-free graphs
Recommended article: Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs
Recommended article: Q3679224
Recommended article: On the structure of graphs with bounded asteroidal number
description: scientific article; zbMATH DE number 1383716