Finding a minimal transitive reduction in a strongly connected digraph within linear time
Download
Permanent link
https://doi.org/10.3929/ethz-a-000628392Publication status
publishedJournal / series
ETH, Eidgenössische Technische Hochschule Zürich, Departement Informatik, Institut für Theoretische InformatikVolume
Publisher
Eidgenössische Technische Hochschule ZürichSubject
Directed graphs; DIRECTED GRAPHS (GRAPH THEORY); GRAPHENALGORITHMEN + GEOMETRISCHE ALGORITHMEN (GRAPHENTHEORIE); PROGRAMS AND ALGORITHMS FOR THE SOLUTION OF SPECIAL PROBLEMS; Graph algorithms; Programs and algorithms for the solution of special problems; PROGRAMME UND ALGORITHMEN ZUR LÖSUNG SPEZIELLER PROBLEME; GRAPH ALGORITHMS + GEOMETRIC ALGORITHMS (GRAPH THEORY); GERICHTETE GRAPHEN (GRAPHENTHEORIE)Organisational unit
02150 - Departement Informatik / Department of Computer Science
Notes
Technical Reports D-INFK.More
Show all metadata
Altmetrics