Welcome to the InfoSci Platform
Reference Hub1
On Vertex Cover Problems in Distributed Systems

On Vertex Cover Problems in Distributed Systems

Can Umut Ileri, Cemil Aybars Ural, Orhan Dagdeviren, Vedat Kavalci
Copyright: © 2016 |Pages: 29
ISBN13: 9781466699649|ISBN10: 1466699647|EISBN13: 9781466699656
DOI: 10.4018/978-1-4666-9964-9.ch001
Cite Chapter Cite Chapter

MLA

Ileri, Can Umut, et al. "On Vertex Cover Problems in Distributed Systems." Advanced Methods for Complex Network Analysis, edited by Natarajan Meghanathan, IGI Global, 2016, pp. 1-29. https://doi.org/10.4018/978-1-4666-9964-9.ch001

APA

Ileri, C. U., Ural, C. A., Dagdeviren, O., & Kavalci, V. (2016). On Vertex Cover Problems in Distributed Systems. In N. Meghanathan (Ed.), Advanced Methods for Complex Network Analysis (pp. 1-29). IGI Global. https://doi.org/10.4018/978-1-4666-9964-9.ch001

Chicago

Ileri, Can Umut, et al. "On Vertex Cover Problems in Distributed Systems." In Advanced Methods for Complex Network Analysis, edited by Natarajan Meghanathan, 1-29. Hershey, PA: IGI Global, 2016. https://doi.org/10.4018/978-1-4666-9964-9.ch001

Export Reference

Mendeley
Favorite

Abstract

An undirected graph can be represented by G(V,E) where V is the set of vertices and E is the set of edges connecting vertices. The problem of finding a vertex cover (VC) is to identify a set of vertices VC such that at least one endpoint of every edge in E is incident to a vertex V in VC. Vertex cover is a very important graph theoretical structure for various types of communication networks such as wireless sensor networks, since VC can be used for link monitoring, clustering, backbone formation and data aggregation management. In this chapter, we will define vertex cover and related problems with their applications on communication networks and we will survey some important distributed algorithms on this research area.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.