On the complexity of connectivity in cognitive radio networks through spectrum assignment (Q2253963): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
aliases / en / 0aliases / en / 0
 
Complexity of Connectivity in Cognitive Radio Networks through Spectrum Assignment
description / endescription / en
scientific article
scientific article; zbMATH DE number 6665639
Property / title
 
Complexity of Connectivity in Cognitive Radio Networks through Spectrum Assignment (English)
Property / title: Complexity of Connectivity in Cognitive Radio Networks through Spectrum Assignment (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1351.68199 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-642-36092-3_13 / rank
 
Normal rank
Property / published in
 
Property / published in: Algorithms for Sensor Systems / rank
 
Normal rank
Property / publication date
 
19 December 2016
Timestamp+2016-12-19T00:00:00Z
Timezone+00:00
Calendar⧼valueview-expert-timevalue-calendar-gregorian⧽
Precision1 day
Before0
After0
Property / publication date: 19 December 2016 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68R10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q17 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6665639 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2162796517 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1301.0995 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gossiping in a Multi-channel Radio Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing weakly connected dominating set for secure clustering in distributed sensor network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Minimum-Degree Steiner Tree to within One of Optimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding All Spanning Trees of Directed and Undirected Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth. Computations and approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on the hardness of generalized connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of connectivity in cognitive radio networks through spectrum assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank

Latest revision as of 17:24, 9 July 2024

scientific article; zbMATH DE number 6665639
  • Complexity of Connectivity in Cognitive Radio Networks through Spectrum Assignment
Language Label Description Also known as
English
On the complexity of connectivity in cognitive radio networks through spectrum assignment
scientific article; zbMATH DE number 6665639
  • Complexity of Connectivity in Cognitive Radio Networks through Spectrum Assignment

Statements

On the complexity of connectivity in cognitive radio networks through spectrum assignment (English)
0 references
Complexity of Connectivity in Cognitive Radio Networks through Spectrum Assignment (English)
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
16 February 2015
0 references
19 December 2016
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
computational complexity
0 references
spectrum assignment
0 references
connectivity
0 references
cognitive radio networks
0 references
0 references
0 references
0 references