The Maximum Degree & Diameter-Bounded Subgraph and its Applications-Reference-Cited by-同舟云学术

The Maximum Degree & Diameter-Bounded Subgraph and its Applications

Published:2012-02-10 Issue:3 Volume:11 Page:249-268
ISSN:1570-1166
Container-title:Journal of Mathematical Modelling and Algorithms
language:en
Short-container-title:J Math Model Algor

Author:

Dekker Anthony,Pérez-Rosés Hebert,Pineda-Villavicencio Guillermo,Watters Paul

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Modeling and Simulation

Link

http://link.springer.com/content/pdf/10.1007/s10852-012-9182-8.pdf

Reference24 articles.

1. Amini, O., Peleg, D., Perennes, S., Sau, I., Saurabh, S.: Degree-constrained subgraph problems: hardness and approximation results. In: Procs. ALGO-WAOA, 2008. LNCS, vol. 5426, pp. 29–42 (2008)

2. Asahiro, Y., Miyano, E., Samizo, K.: Approximating maximum diameter-bounded subgraphs. In: Procs. LATIN, 2010. LNCS, vol. 6034, pp. 615–626 (2010)

3. Barabási, A.-L., Albert, R.: Emergence of scaling in random networks. Science 286, 509–512 (1999)

4. Barabási, A.-L.: Linked: The New Science of Networks. Perseus Publishing (2002)

5. Cohen, G., Honkala, I., Litsyn, S., Lobstein, A.: Covering Codes. Elsevier, Amsterdam (1997)

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. From Local Network Formation Game to Peer-to-Peer Protocol;2021 International Symposium on Electrical, Electronics and Information Engineering;2021-02-19

2. Perigee: Efficient Peer-to-Peer Network Design for Blockchains;Proceedings of the 39th Symposium on Principles of Distributed Computing;2020-07-31

3. Optimal Graphs in the Enhanced Mesh Networks;Journal of Mathematics;2020-05-01

4. Runtime Analysis of Evolutionary Multi-objective Algorithms Optimising the Degree and Diameter of Spanning Trees;Lecture Notes in Computer Science;2019

5. MaxDDBS Problem on Beneš Network;Journal of Interconnection Networks;2017-09