Homogeneous sets and domination problems

DOI10.1007/3-540-62559-3_26zbMATH Open1539.05114MaRDI QIDQ6550554FDOQ6550554

Authors: Falk Nicolai, Thomas Szymczak 

Publication date: 5 June 2024

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Distance-Hereditary Graphs, Steiner Trees, and Connected Domination
• Title not available (Why is that?)
• Title not available (Why is that?)
• The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
• Title not available (Why is that?)
• A simple parallel tree contraction algorithm
• Efficient parallel algorithms for r-dominating set and p-center problems on trees
• Dually chordal graphs
• r-Domination problems on homogeneously orderable graphs
• Efficient parallel modular decomposition (extended abstract)

This page was built for publication: Homogeneous sets and domination problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6550554)