On the complexity of connectivity in cognitive radio networks through spectrum assignment
DOI10.1007/s10878-013-9605-0zbMath1316.90006arXiv1301.0995OpenAlexW1997229267MaRDI QIDQ2253963
Tiancheng Lou, Hongyu Liang, Dongxiao Yu, Haisheng Tan, Yuexuan Wang
Publication date: 16 February 2015
Published in: Journal of Combinatorial Optimization, Algorithms for Sensor Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1301.0995
Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Communication networks in operations research (90B18) Graph theory (including graph drawing) in computer science (68R10) Discrete location and assignment (90B80) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Constructing weakly connected dominating set for secure clustering in distributed sensor network
- Treewidth. Computations and approximations
- Note on the hardness of generalized connectivity
- On the complexity of connectivity in cognitive radio networks through spectrum assignment
- Gossiping in a Multi-channel Radio Network
- Graph minors. II. Algorithmic aspects of tree-width
- Finding All Spanning Trees of Directed and Undirected Graphs
- Approximating the Minimum-Degree Steiner Tree to within One of Optimal
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
This page was built for publication: On the complexity of connectivity in cognitive radio networks through spectrum assignment
