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

← Older edit

@@ aliases / en / 0 / aliases / en / 0 @@
+Complexity of Connectivity in Cognitive Radio Networks through Spectrum Assignment
@@ description / en / description / en @@
+scientific article; zbMATH DE number 6665639
@@ Property / title @@
+Complexity of Connectivity in Cognitive Radio Networks through Spectrum Assignment (English)
+Normal rank
@@ Property / zbMATH Open document ID @@
+.68199
@@ Property / zbMATH Open document ID: 1351.68199 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/978-3-642-36092-3_13
@@ Property / DOI: 10.1007/978-3-642-36092-3_13 / rank @@
+Normal rank
@@ Property / published in @@
+Algorithms for Sensor Systems
@@ Property / published in: Algorithms for Sensor Systems / rank @@
+Normal rank
@@ Property / publication date @@
+December 2016Timestamp +2016-12-19T00:00:00Z
Timezone +00:00
Calendar Gregorian
Precision 1 day
Before 0
After 0
-Timestamp
++2016-12-19T00:00:00Z
-Timezone
++00:00
-Calendar
+Gregorian
-Precision
+day
 Before
 After
@@ Property / publication date: 19 December 2016 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+R10
@@ Property / Mathematics Subject Classification ID: 68R10 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q17
@@ Property / Mathematics Subject Classification ID: 68Q17 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q25
@@ Property / Mathematics Subject Classification ID: 68Q25 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6665639
@@ Property / zbMATH DE Number: 6665639 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2162796517
@@ Property / OpenAlex ID: W2162796517 / rank @@
+Normal rank
@@ Property / cites work @@
+An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
+Normal rank
@@ Property / cites work @@
+Gossiping in a Multi-channel Radio Network
@@ Property / cites work: Gossiping in a Multi-channel Radio Network / rank @@
+Normal rank
@@ Property / cites work @@
+Q4393480
@@ Property / cites work: Q4393480 / rank @@
+Normal rank
@@ Property / cites work @@
+Constructing weakly connected dominating set for secure clustering in distributed sensor network
+Normal rank
@@ Property / cites work @@
+Approximating the Minimum-Degree Steiner Tree to within One of Optimal
+Normal rank
@@ Property / cites work @@
+Finding All Spanning Trees of Directed and Undirected Graphs
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Treewidth. Computations and approximations
@@ Property / cites work: Treewidth. Computations and approximations / rank @@
+Normal rank
@@ Property / cites work @@
+Note on the hardness of generalized connectivity
@@ Property / cites work: Note on the hardness of generalized connectivity / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of connectivity in cognitive radio networks through spectrum assignment
+Normal rank
@@ Property / cites work @@
+Graph minors. II. Algorithmic aspects of tree-width
+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