On connected domination in unit ball graphs (Q537633): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(8 intermediate revisions by 7 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s11590-010-0211-0 / rank
Normal rank
 
Property / author
 
Property / author: Sergiy I. Butenko / rank
Normal rank
 
Property / author
 
Property / author: Sergiy I. Butenko / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C59 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B10 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 5898455 / rank
 
Normal rank
Property / zbMATH Keywords
 
connected dominating set
Property / zbMATH Keywords: connected dominating set / rank
 
Normal rank
Property / zbMATH Keywords
 
unit ball graph
Property / zbMATH Keywords: unit ball graph / rank
 
Normal rank
Property / zbMATH Keywords
 
wireless networks
Property / zbMATH Keywords: wireless networks / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11590-010-0211-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1987607815 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unit disk graph recognition is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unit disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4219187 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for connected dominating sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bottleneck domination algorithms / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S11590-010-0211-0 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:51, 9 December 2024

scientific article
Language Label Description Also known as
English
On connected domination in unit ball graphs
scientific article

    Statements

    Identifiers