"On the Complexity of Approximating Colored-Graph Problems."

Andrea E. F. Clementi, Pierluigi Crescenzi, Gianluca Rossi (1999)

Details and statistics

DOI: 10.1007/3-540-48686-0_28

access: closed

type: Conference or Workshop Paper

metadata version: 2023-02-12

a service of  Schloss Dagstuhl - Leibniz Center for Informatics