A polynomial time algorithm for finding a spanning tree with maximum number of internal vertices on interval graphs

From MaRDI portal

(Redirected from Publication:4632175)

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_polynomial_time_algorithm_for_finding_a_spanning_tree_with_maximum_number_of_internal_vertices_on_interval_graphs&oldid=82292696"