{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T14:14:36Z","timestamp":1761401676917},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,3,30]],"date-time":"2013-03-30T00:00:00Z","timestamp":1364601600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2015,2]]},"DOI":"10.1007\/s10878-013-9605-0","type":"journal-article","created":{"date-parts":[[2013,3,29]],"date-time":"2013-03-29T00:09:50Z","timestamp":1364515790000},"page":"472-487","source":"Crossref","is-referenced-by-count":5,"title":["On the complexity of connectivity in cognitive radio networks through spectrum assignment"],"prefix":"10.1007","volume":"29","author":[{"given":"Hongyu","family":"Liang","sequence":"first","affiliation":[]},{"given":"Tiancheng","family":"Lou","sequence":"additional","affiliation":[]},{"given":"Haisheng","family":"Tan","sequence":"additional","affiliation":[]},{"given":"Yuexuan","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Dongxiao","family":"Yu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,3,30]]},"reference":[{"key":"9605_CR1","doi-asserted-by":"crossref","unstructured":"Bahl P, Chandra R, Moscibroda T, Murty R, Welsh M (2009) White space networking with Wi-Fi like connectivity. In ACM SIGCOMM","DOI":"10.1145\/1592568.1592573"},{"issue":"6","key":"9605_CR2","doi-asserted-by":"crossref","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"HL Bodlaender","year":"1996","unstructured":"Bodlaender HL (1996) A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J Comput 25(6):1305\u20131317","journal-title":"SIAM J Comput"},{"key":"9605_CR3","first-page":"376","volume":"23","author":"A Cayley","year":"1889","unstructured":"Cayley A (1889) A theorem on trees. Q J Pure Appl Math 23:376\u2013378","journal-title":"Q J Pure Appl Math"},{"key":"9605_CR4","doi-asserted-by":"crossref","unstructured":"Chen X, Huang J (2012) Spatial spectrum access game: nash equilibria and distributed learning. In ACM MobiHoc","DOI":"10.1145\/2248371.2248401"},{"key":"9605_CR5","unstructured":"Dolev S, Gilbert S, Guerraoui R, Newport CC (2007) Gossiping in a multi-channel radio network. In DISC"},{"key":"9605_CR6","volume-title":"Parameterized complexity","author":"R Downey","year":"1998","unstructured":"Downey R, Fellows M (1998) Parameterized complexity. Springer, Berlin"},{"issue":"2","key":"9605_CR7","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/s10878-010-9358-y","volume":"23","author":"H Du","year":"2012","unstructured":"Du H, Wu W, Shan S, Kim D, Lee W (2012) Constructing weakly connected dominating set for secure clustering in distributed sensor network. J Comb Optim 23(2):301\u2013307","journal-title":"J Comb Optim"},{"issue":"3","key":"9605_CR8","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1006\/jagm.1994.1042","volume":"17","author":"M F\u00fcrer","year":"1994","unstructured":"F\u00fcrer M, Raghavachari B (1994) Approximating the minimum-degree steiner tree to within one of optimal. J Algorithms 17(3):409\u2013423","journal-title":"J Algorithms"},{"issue":"3","key":"9605_CR9","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1137\/0207024","volume":"7","author":"H Gabow","year":"1978","unstructured":"Gabow H, Myers E (1978) Finding all spanning trees of directed and undirected graphs. SIAM J Comput 7(3):280\u2013287","journal-title":"SIAM J Comput"},{"key":"9605_CR10","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"M Garey","year":"1979","unstructured":"Garey M, Johnson D (1979) Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman, New York"},{"issue":"4","key":"9605_CR11","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"J Hopcroft","year":"1973","unstructured":"Hopcroft J, Karp R (1973) An $$n^{5\/2}$$ algorithm for maximum matchings in bipartite graphs. SIAM J Comput 2(4):225\u2013231","journal-title":"SIAM J Comput"},{"key":"9605_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0045375","volume-title":"Treewidth: computations and approximations, vol 842 of LNCS","author":"T Kloks","year":"1994","unstructured":"Kloks T (1994) Treewidth: computations and approximations, vol 842 of LNCS. Springer, Berlin"},{"issue":"5","key":"9605_CR13","doi-asserted-by":"crossref","first-page":"715","DOI":"10.1007\/s11276-007-0045-6","volume":"14","author":"F Kuhn","year":"2008","unstructured":"Kuhn F, Wattenhofer R, Zollinger A (2008) Ad hoc networks beyond unit disk graphs. Wirel Netw 14(5):715\u2013729","journal-title":"Wirel Netw"},{"issue":"3","key":"9605_CR14","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/s10878-011-9399-x","volume":"24","author":"S Li","year":"2012","unstructured":"Li S, Li X (2012) Note on the hardness of generalized connectivity. J Comb Optim 24(3):389\u2013396","journal-title":"J Comb Optim"},{"key":"9605_CR15","doi-asserted-by":"crossref","unstructured":"Li X.-Y., Yang P, Yan Y, You L, Tang S, Huang Q (2012) Almost optimal accessing of nonstochastic channels in cognitive radio networks. In IEEE INFOCOM","DOI":"10.1109\/INFCOM.2012.6195616"},{"key":"9605_CR16","doi-asserted-by":"crossref","unstructured":"Liang H, Lou T, Tan H, Wang Y, Yu D (2013) Complexity of connectivity in cognitive radio networks through spectrum assignment. In ALGOSENSORS\u201912, vol 7718 of LNCS, pp 108\u2013119","DOI":"10.1007\/978-3-642-36092-3_13"},{"key":"9605_CR17","doi-asserted-by":"crossref","unstructured":"Lu D, Huang X, Li P, Fan J (2012) Connectivity of large-scale cognitive radio ad hoc networks. In IEEE INFOCOM","DOI":"10.1109\/INFCOM.2012.6195487"},{"key":"9605_CR18","doi-asserted-by":"crossref","unstructured":"Ren W, Zhao Q, Swami A (2009) Connectivity of cognitive radio networks: Proximity vs. opportunity. In ACM CoRoNet","DOI":"10.1145\/1614235.1614245"},{"issue":"7","key":"9605_CR19","first-page":"1283","volume":"27","author":"W Ren","year":"2009","unstructured":"Ren W, Zhao Q, Swami A (2009) Power control in cognitive radio networks: how to cross a multi-lane highway. IEEE JSAC 27(7):1283\u20131296","journal-title":"IEEE JSAC"},{"key":"9605_CR20","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N Robertson","year":"1986","unstructured":"Robertson N, Seymour PD (1986) Graph minors. ii. algorithmic aspects of treewidth. J Algorithms 7:309\u2013322","journal-title":"J Algorithms"},{"issue":"7","key":"9605_CR21","first-page":"1283","volume":"27","author":"A Shukla","year":"2009","unstructured":"Shukla A (2009) A short proof of Cayley\u2019s tree formula. arXiv:0908.2324v2. IEEE JSAC 27(7):1283\u20131296","journal-title":"IEEE JSAC"},{"issue":"1","key":"9605_CR22","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1109\/JSTSP.2010.2093210","volume":"5","author":"B Wang","year":"2011","unstructured":"Wang B, Liu KJR (2011) Advances in cognitive radio networks: a survey. IEEE J Sel Top Signal Process 5(1):5\u201323","journal-title":"IEEE J Sel Top Signal Process"},{"issue":"9","key":"9605_CR23","first-page":"1771","volume":"30","author":"J Yu","year":"2012","unstructured":"Yu J, Roh H, Lee W, Pack S, Du D-Z (2012) Topology control in cooperative wireless ad-hoc networks. IEEE JSAC 30(9):1771\u20131779","journal-title":"IEEE JSAC"},{"key":"9605_CR24","doi-asserted-by":"crossref","unstructured":"Yuan Y, Bahl P, Chandra R, Moscibroda T, Wu Y (2007) Allocating dynamic time-spectrum blocks in cognitive radio networks. In ACM Mobihoc","DOI":"10.1145\/1288107.1288125"},{"key":"9605_CR25","doi-asserted-by":"crossref","unstructured":"Zhou X, Gandhi S, Suri S, Zheng H (2008) ebay in the sky: strategyproof wireless spectrum auctions. In ACM MobiCom","DOI":"10.1145\/1409944.1409947"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9605-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-013-9605-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9605-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,11]],"date-time":"2019-07-11T10:23:59Z","timestamp":1562840639000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-013-9605-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3,30]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,2]]}},"alternative-id":["9605"],"URL":"https:\/\/doi.org\/10.1007\/s10878-013-9605-0","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,3,30]]}}}