Mamoru Imanishi

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
The edge searching problem is to find the minimum number of searchers to capture an intruder that is hiding on vertices or edges of a graph. A 3-cycle-disjoint graph is a connected graph in which no pair of cycles share a vertex and every cycle has at most three vertices with degree more than two. In this paper, we consider the edge searching problem on(More)
Abstract Under the scheme of Japanese City Renewal Law (JCRL), the cost of urban redevelopment project has been financed by the revenue from selling the reservation floor secured beforehand in the redeveloped building. Since the outcome of whether or not the reservation floor can be sold is unforeseeable, entities for redevelopment are faced with the risk(More)
  • 1