OpenAlex | An efficient algorithm for the transitive closure and a linear worst-case complexity result for a class of sparse graphs

An efficient algorithm for the transitive closure and a linear worst-case complexity result for a class of sparse graphs

Work

Year: 1986

Type: article

Source: Information Processing Letters

Authors Brigitte Jaumard, Michel Minoux

Institutions Rutgers, The State University of New Jersey, Université Paris Dauphine-PSL

Cites: 24

Cited by: 5

Related to: 10

FWCI: 1.38

Citation percentile (by year/subfield): 59.31

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed