Scholarlink

Subgraphs of a graph may have some special properties and detecting these subgraphs may be useful for various applications. In this chapter, we study theory and sequential, parallel, and distributed algorithms for three such special subgraphs: independent sets, dominating sets, and vertex cover.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Independence, Domination, and Vertex Cover

  • 章节

  • 发表日期：

    2026年

查看全文
  • K. Erciyes

摘要

Subgraphs of a graph may have some special properties and detecting these subgraphs may be useful for various applications. In this chapter, we study theory and sequential, parallel, and distributed algorithms for three such special subgraphs: independent sets, dominating sets, and vertex cover.