Complexity of finding k-path-free dominating sets in graphs

DOI10.1016/0020-0190(82)90021-7MaRDI QIDQ1167535zbMATH OpenOpenAlexFDO

Authors Reuven Bar-Yehuda, Uzi Vishkin

Publication date 1982

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(82)90021-7

zbMATH Keywords

dominating setgraph algorithmsNP-completenessdirected graphtournamentsatisfiability problem

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cites work

• scientific article; zbMATH DE number 3688740 (Why is no real title available?)
• scientific article; zbMATH DE number 3465337 (Why is no real title available?)
• scientific article; zbMATH DE number 3482343 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3299758 (Why is no real title available?)
• scientific article; zbMATH DE number 3303831 (Why is no real title available?)
• scientific article; zbMATH DE number 3407692 (Why is no real title available?)
• Problems and methods with multiple objective functions

Cited in

(3)

• Bibliography on domination in graphs and some basic definitions of domination parameters
• On the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs
• Combinatorial analysis (nonnegative matrices, algorithmic problems)

This page was built for publication: Complexity of finding k-path-free dominating sets in graphs

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