Pages that link to "Item:Q2166266"

From MaRDI portal

← A linear-time algorithm for minimum \(k\)-hop dominating set of a cactus graph (Q2166266)

Jump to:navigation, search

What links here

⧼whatlinkshere-whatlinkshere-target⧽

Page:

⧼whatlinkshere-whatlinkshere-ns⧽

Namespace:

Invert selection

⧼whatlinkshere-whatlinkshere-filter⧽

Hide transclusions

Hide links

Hide redirects

The following pages link to A linear-time algorithm for minimum \(k\)-hop dominating set of a cactus graph (Q2166266):

Displaying 1 item.

Guarding polyominoes under \(k\)-hop visibility (Q6547940) (← links)

Retrieved from "https://portal.mardi4nfdi.de/wiki/Special:WhatLinksHere/Item:Q2166266"