Routing-efficient CDS construction in disk-containment graphs (Q2448125): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s11590-012-0590-5 / rank
Normal rank
 
Property / author
 
Property / author: Eugene M. Maslov / rank
Normal rank
 
Property / author
 
Property / author: Won Jun Lee / rank
Normal rank
 
Property / author
 
Property / author: Eugene M. Maslov / rank
 
Normal rank
Property / author
 
Property / author: Won Jun Lee / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11590-012-0590-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2045711969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unit disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228484 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for connected dominating sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / 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: Distributed dynamic channel access scheduling for ad hoc networks. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On constructing \(k\)-connected \(k\)-dominating set in wireless ad hoc and sensor networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum connected dominating sets and maximal independent sets in unit disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximation algorithms of \(k\)-connected \(m\)-dominating sets in disk graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S11590-012-0590-5 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:01, 18 December 2024

scientific article
Language Label Description Also known as
English
Routing-efficient CDS construction in disk-containment graphs
scientific article

    Statements

    Identifiers