Damaschke, Peter Finding hidden hubs and dominating sets in sparse graphs by randomized neighborhood queries. (English) Zbl 1223.05208 Networks 57, No. 4, 344-350 (2011). MSC: 05C69 68P10 PDFBibTeX XMLCite \textit{P. Damaschke}, Networks 57, No. 4, 344--350 (2011; Zbl 1223.05208) Full Text: DOI
Warrier, Deepak; Wilhelm, Wilbert E.; Warren, Jeffrey S.; Hicks, Illya V. A branch-and-price approach for the maximum weight independent set problem. (English) Zbl 1093.90089 Networks 46, No. 4, 198-209 (2005). MSC: 90C57 PDFBibTeX XMLCite \textit{D. Warrier} et al., Networks 46, No. 4, 198--209 (2005; Zbl 1093.90089) Full Text: DOI
Caprara, Alberto; Panconesi, Alessandro; Rizzi, Romeo Packing cuts in undirected graphs. (English) Zbl 1044.05063 Networks 44, No. 1, 1-11 (2004). MSC: 05C85 90C05 05C70 68R10 90C35 PDFBibTeX XMLCite \textit{A. Caprara} et al., Networks 44, No. 1, 1--11 (2004; Zbl 1044.05063) Full Text: DOI
Cheng, Xiuzhen; Huang, Xiao; Li, Deying; Wu, Weili; Du, Ding-Zhu A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks. (English) Zbl 1031.05092 Networks 42, No. 4, 202-208 (2003). MSC: 05C69 05C85 PDFBibTeX XMLCite \textit{X. Cheng} et al., Networks 42, No. 4, 202--208 (2003; Zbl 1031.05092) Full Text: DOI Link
Manacher, Glenn K.; Mankus, Terrance A. A simple linear time algorithm for finding a maximum independent set of circular arcs using intervals alone. (English) Zbl 0994.05142 Networks 39, No. 2, 68-72 (2002). Reviewer: Haiko Müller (Leeds) MSC: 05C85 90C35 68R10 68Q25 05C62 05C69 PDFBibTeX XMLCite \textit{G. K. Manacher} and \textit{T. A. Mankus}, Networks 39, No. 2, 68--72 (2002; Zbl 0994.05142) Full Text: DOI
Nicolai, Falk; Szymczak, Thomas Homogeneous sets and domination: A linear time algorithm for distance-hereditary graphs. (English) Zbl 0974.05060 Networks 37, No. 3, 117-128 (2001). MSC: 05C69 05C70 05C85 05C12 PDFBibTeX XMLCite \textit{F. Nicolai} and \textit{T. Szymczak}, Networks 37, No. 3, 117--128 (2001; Zbl 0974.05060) Full Text: DOI
Chen, Jianer; Liu, Lihua; Jia, Weijia Improvement on vertex cover for low-degree graphs. (English) Zbl 0974.05078 Networks 35, No. 4, 253-259 (2000). MSC: 05C85 90C27 90B10 05C70 PDFBibTeX XMLCite \textit{J. Chen} et al., Networks 35, No. 4, 253--259 (2000; Zbl 0974.05078) Full Text: DOI
Wang, Guifang; Zhang, Lianzhu The structure of \(\max\lambda-\min m_{\lambda+1}\) graphs used in the design of reliable networks. (English) Zbl 0893.90169 Networks 30, No. 4, 231-242 (1997). MSC: 90C35 90B25 PDFBibTeX XMLCite \textit{G. Wang} and \textit{L. Zhang}, Networks 30, No. 4, 231--242 (1997; Zbl 0893.90169) Full Text: DOI
Marathe, M. V.; Breu, H.; Hunt, H. B. III; Ravi, S. S.; Rosenkrantz, D. J. Simple heuristics for unit disk graphs. (English) Zbl 0821.90128 Networks 25, No. 2, 59-68 (1995). MSC: 90C35 05C70 PDFBibTeX XMLCite \textit{M. V. Marathe} et al., Networks 25, No. 2, 59--68 (1995; Zbl 0821.90128) Full Text: DOI arXiv
Kashiwabara, Toshinobu; Masuda, Sumio; Nakajima, Kazuo; Fujisawa, Toshio Polynomial time algorithms on circular-arc overlap graphs. (English) Zbl 0722.90078 Networks 21, No. 2, 195-203 (1991). Reviewer: W.Li (Changsha) MSC: 90C35 90C60 05C85 68R10 68Q25 PDFBibTeX XMLCite \textit{T. Kashiwabara} et al., Networks 21, No. 2, 195--203 (1991; Zbl 0722.90078) Full Text: DOI
Hsu, Lihhsing; Wang, Shihyih Maximum independent number for series-parallel networks. (English) Zbl 0736.05050 Networks 21, No. 4, 457-468 (1991). Reviewer: C.J.Colbourn (Waterloo / Ontario) MSC: 05C35 90C35 PDFBibTeX XMLCite \textit{L. Hsu} and \textit{S. Wang}, Networks 21, No. 4, 457--468 (1991; Zbl 0736.05050) Full Text: DOI
Burns, James E. The maximum independent set problem for cubic planar graphs. (English) Zbl 0678.05024 Networks 19, No. 3, 373-378 (1989). Reviewer: D.Du MSC: 05C35 PDFBibTeX XMLCite \textit{J. E. Burns}, Networks 19, No. 3, 373--378 (1989; Zbl 0678.05024) Full Text: DOI
Choukhmane, Elarbi; Franco, John An approximation algorithm for the maximum independent set problem in cubic planar graphs. (English) Zbl 0644.90093 Networks 16, No. 4, 349-356 (1986). MSC: 90C35 68Q25 PDFBibTeX XMLCite \textit{E. Choukhmane} and \textit{J. Franco}, Networks 16, No. 4, 349--356 (1986; Zbl 0644.90093) Full Text: DOI
Gupta, U. I.; Lee, D. T.; Leung, J. Y.-T. Efficient algorithms for interval graphs and circular-arc graphs. (English) Zbl 0493.68066 Networks 12, 459-467 (1982). MSC: 68R10 68Q25 05C35 PDFBibTeX XMLCite \textit{U. I. Gupta} et al., Networks 12, 459--467 (1982; Zbl 0493.68066) Full Text: DOI