Work

An $O(n)$-time algorithm to compute minimum $k$-hop connected dominating set of interval graphs

Year: 2020

Type: article

Source: Malaya Journal of Matematik

DOI: 10.26637/mjm0s20/0110

Authors: Sambhu Charan Barman, Madhumangal Pal, Sukumar Mondal

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

OpenAlex ID: W3033217487

FWCI:

Cites:

Cited by:

Related to: 10