Exercises marked with (*) require further reading/search beyond the suggested texts.
Find a situation in the improved placement algorithm in which processing a new set in DFS creates no new class.
Find a situation in the improved placement algorithm in which processing a new set in DFS creates all three types of classes: empty, full, and partial.
Find a situation in the improved placement algorithm in which processing a new set in DFS destroys the C1P by not having and empty neighbor to place an uncolored subclass.
Find a situation in the improved placement algorithm in which processing a new set in DFS destroys the C1P by not having all full classes consecutive.
Find a situation in the improved placement algorithm in which processing a new set in DFS destroys the C1P by having a new class but not a full extremity in the path to place it.
© 2015 Joao Meidanis