Improved bottleneck domination algorithms

DOI10.1016/j.dam.2006.02.003zbMath1104.68129OpenAlexW2047444378MaRDI QIDQ2499580

Dieter Kratsch, Chuan-Min Lee, Ji Ping Liu, Ton Kloks

Publication date: 14 August 2006

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2006.02.003

zbMATH Keywords

chordal graphsAT-free graphspermutation graphsbottleneck dominationbottleneck independent domination

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

On connected domination in unit ball graphs

Cites Work

• Introduction to ``Topics on Domination
• An efficient algorithm for maxdominance, with applications
• Independent domination in chordal graphs
• Modular decomposition and transitive orientation
• Treewidth. Computations and approximations
• Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs
• Domination on Cocomparability Graphs
• Graph Classes: A Survey
• Independent Sets in Asteroidal Triple-Free Graphs
• A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
• Graph-Theoretic Concepts in Computer Science
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Improved bottleneck domination algorithms