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

From MaRDI portal
Merged Item from Q5507396
ReferenceBot (talk | contribs)
Changed an Item
 
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 16: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
16 February 2015
0 references
19 December 2016
0 references
computational complexity
0 references
spectrum assignment
0 references
connectivity
0 references
cognitive radio networks
0 references

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references