A resource assignment problem on graphs

DOI10.1007/BFB0015448MaRDI QIDQ6487990zbMATH OpenFDO

Authors Satoshi Fujita, Tiko Kameda, Masafumi Yamashita

Publication date 21 March 2023

Full work available at URL https://doi.org/10.1007/BFB0015448

Mathematics Subject Classification ID

Signed and weighted graphs (05C22) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cites work

• Finding a minimum independent dominating set in a permutation graph
• scientific article; zbMATH DE number 4085682 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1354118 (Why is no real title available?)
• scientific article; zbMATH DE number 975419 (Why is no real title available?)
• Linear algorithm for domatic number problem on interval graphs
• On approximating the minimum independent dominating set
• On the domatic number of interval graphs
• Perfect codes in graphs
• The Domatic Number Problem in Interval Graphs
• The weighted perfect domination problem

This page was built for publication: A resource assignment problem on graphs

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