Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
F. Bonomo
Information about the author F. Bonomo will soon be added to the site.
Found
1 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Computational complexity of classical problems for hereditary clique-Helly graphs
2004
A graph is clique-Helly when its cliques satisfy the Helly property. A graph is...
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers
