| [ QuizWit ] in KIDS 글 쓴 이(By): guest (Guest) <203.229.239.240> 날 짜 (Date): 1999년 11월 1일 월요일 오후 04시 24분 12초 제 목(Title): [문제] Conflict Graph를 Vertex Coloring A Conflict graph is a graph consisting of a set of vertices and a set of edges. An edge in a conflict graph defines a conflict relation between the respective vertices. Show that the problem of unconstrained scheduling of a non-hierarchical sequencing graph can be mapped to vertex coloring problem (for a conflict graph). 숙제해줘요. 음냐.. |