Assertion: abstract graph | /r/HasProperty | given as input
Facets:
Source sentences:
text: Even if a disk representation is not known, and an abstract graph is given as input, it is possible in polynomial time to produce either a maximum clique or a proof that the graph is not a unit disk graph, and to 3-approximate the optimum coloring by using a greedy coloring algorithm.