An \(O(n^3)\) time algorithm for recognizing threshold dimension 2 graphs

From MaRDI portal

An \(O(n^3)\) time algorithm for recognizing threshold dimension 2 graphs

Jump to:navigation, search

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=An_%5C(O(n%5E3)%5C)_time_algorithm_for_recognizing_threshold_dimension_2_graphs&oldid=60705132"