Work

Efficient computation of implicit representations of sparse graphs

Year: 1997

Type: article

Source: Discrete Applied Mathematics

DOI: 10.1016/s0166-218x(97)00007-3

Authors: Srinivasa R. Arikati, Anil Maheshwari, Christos D. Zaroliagis

Institutions: Max Planck Society, Max Planck Institute for Informatics, Carleton University

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: bronze

OpenAlex ID: W2017492483

FWCI: 0.468

Cites: 21

Cited by: 32

Related to: 10