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

From MaRDI portal

(Redirected from Publication:293369)
An \(O(n^3)\) time algorithm for recognizing threshold dimension 2 graphs

Jump to:navigation, search

MaRDI QID[[Item:|]]

Authors

No records found

Cited in

No records found

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item )

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"