Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Kameda
Information about the author Kameda will soon be added to the site.
Found
1 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Max‐ and Min‐Neighborhood Monopolies
2002
Given a graph G=(V,E) and a set of vertices M ⊆ V , a vertex v ∈ V is said...
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers
