Algorithms for graphs with small octopus
From MaRDI portal
Publication:1421464
DOI10.1016/S0166-218X(03)00298-1zbMath1032.05123WikidataQ60488771 ScholiaQ60488771MaRDI QIDQ1421464
Haiko Müller, Dieter Kratsch, Fedor V. Fomin
Publication date: 26 January 2004
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
ClusteringBandwidthApproximation algorithmDominationGraph algorithm\(\lambda\)-coloringBilateral orientation
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An approximation algorithm for clustering graphs with dominating diametral path
- A note on total domination
- Approximation algorithms for combinatorial problems
- Distances in orientations of graphs
- On the ratio of optimal integral and fractional covers
- Clustering bipartite and chordal graphs: Complexity, sequential and parallel algorithms
- Chordal completions of planar graphs
- Approximating the bandwidth via volume respecting embeddings
- Domination and total domination on asteroidal triple-free graphs
- On Hadwiger's Number and the Stability Number
- Strongly connected orientations of mixed multigraphs
- A survey of gossiping and broadcasting in communication networks
- On the Optimal Strongly Connected Orientations of City Street Graphs I: Large Grids
- The bandwidth problem for graphs and matrices—a survey
- Labelling Graphs with a Condition at Distance 2
- Graph Classes: A Survey
- Independent Sets in Asteroidal Triple-Free Graphs
- Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs
- Domino Treewidth
- Approximating the Bandwidth for Asteroidal Triple-Free Graphs
- The $L(2,1)$-Labeling Problem on Graphs
- A Theorem on Graphs, with an Application to a Problem of Traffic Control
- On the structure of graphs with bounded asteroidal number
- Bandwidth and topological bandwidth of graphs with few \(P_4\)'s
