A linear time algorithm for computing a minimum paired-dominating set of a convex bipartite graph

From MaRDI portal

(Redirected from A linear time algorithm for computing a minimum paired-dominating set of a convex bipartite graph)

Jump to:navigation, search

WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=A_linear_time_algorithm_for_computing_a_minimum_paired-dominating_set_of_a_convex_bipartite_graph&oldid=74120532"