Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
G. Tinhofer
Information about the author G. Tinhofer will soon be added to the site.
Found
2 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
A note on compact graphs
1991
An undirected simple graph G is called compact iff its adjacency matrix A is such that...
A branch and bound algorithm for the maximum clique problem
1990
The authors present a branch and bound algorithm for the maximum clique problem in...
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers
