"An O(n log log n) Time Algorithm for Constructing a Graph of Maximum ..."

Takao Asano (1995)

> Home

Details and statistics

DOI: 10.1006/JCSS.1995.1086

access: open

type: Journal Article

metadata version: 2021-02-16

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jcss/Asano95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jcss/Asano95
Takao Asano:
An O(n log log n) Time Algorithm for Constructing a Graph of Maximum Connectivity with Prescribed Degrees. J. Comput. Syst. Sci. 51(3): 503-510 (1995)

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.