Algorithms for graphs with small octopus
type: Item
instance of: scholarly article
title: Algorithms for graphs with small octopus
zbMATH Open document ID: 1032.05123
DOI: 10.1016/S0166-218X(03)00298-1
author: Dieter Kratsch
author: Haiko Müller
author: Fedor V. Fomin
published in: Discrete Applied Mathematics
publication date: 2004-01-26T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 2032812
zbMATH Keywords: Approximation algorithm
zbMATH Keywords: Graph algorithm
zbMATH Keywords: Bandwidth
zbMATH Keywords: Clustering
zbMATH Keywords: \(\lambda\)-coloring
zbMATH Keywords: Bilateral orientation
zbMATH Keywords: Domination
Wikidata QID: Q60488771
MaRDI profile type: Publication
cites work: Clustering bipartite and chordal graphs: Complexity, sequential and parallel algorithms
cites work: A note on total domination
cites work: Q4258216
cites work: Q4699283
cites work: Domino Treewidth
cites work: Q4501549
cites work: Graph Classes: A Survey
cites work: Independent Sets in Asteroidal Triple-Free Graphs
cites work: The $L(2,1)$-Labeling Problem on Graphs
cites work: The bandwidth problem for graphs and matrices—a survey
cites work: Strongly connected orientations of mixed multigraphs
cites work: Chordal completions of planar graphs
cites work: Distances in orientations of graphs
cites work: Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs
cites work: An approximation algorithm for clustering graphs with dominating diametral path
cites work: Q4503944
cites work: On Hadwiger's Number and the Stability Number
cites work: Approximating the bandwidth via volume respecting embeddings
cites work: Q4232802
cites work: Q4414499
cites work: Q4536372
cites work: Q4198056
cites work: Labelling Graphs with a Condition at Distance 2
cites work: A survey of gossiping and broadcasting in communication networks
cites work: Approximation algorithms for combinatorial problems
cites work: Approximating the Bandwidth for Asteroidal Triple-Free Graphs
cites work: On the structure of graphs with bounded asteroidal number
cites work: Bandwidth and topological bandwidth of graphs with few \(P_4\)'s
cites work: Domination and total domination on asteroidal triple-free graphs
cites work: On the ratio of optimal integral and fractional covers
cites work: Q4527015
cites work: A Theorem on Graphs, with an Application to a Problem of Traffic Control
cites work: On the Optimal Strongly Connected Orientations of City Street Graphs I: Large Grids
description: scientific article; zbMATH DE number 2032812