Work

Finding a Maximum Density Subgraph

Year: 1984

Type: report

Source: UC Berkeley

Author: Andrew V. Goldberg

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W183656749

Cites:

Cited by: 361

Related to: 10