"Finding the Connected Components and a Maximum Clique of an Intersection ..."

Hiroshi Imai, Takao Asano (1983)

> Home

Details and statistics

DOI: 10.1016/0196-6774(83)90012-3

access: closed

type: Journal Article

metadata version: 2017-05-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jal/ImaiA83
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jal/ImaiA83
Hiroshi Imai, Takao Asano:
Finding the Connected Components and a Maximum Clique of an Intersection Graph of Rectangles in the Plane. J. Algorithms 4(4): 310-323 (1983)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.