Finding a minimal transitive reduction in a strongly connected digraph within linear time

Metadata Label Value
Author(s): Simon, Klaus
Publisher: Eidgenössische Technische Hochschule Zürich
Citation:

Simon, Klaus. Finding a minimal transitive reduction in a strongly connected digraph within linear time. Eidgenössische Technische Hochschule Zürich (1989). http://dx.doi.org/10.3929/ethz-a-000628392

Document Type: Reports  
Documents: Text (1.12MB)

Detailed Information

Metadata Description
Title Finding a minimal transitive reduction in a strongly connected digraph within linear time
Author(s) Simon, Klaus
Publication Place Zürich
Publisher Eidgenössische Technische Hochschule Zürich
Publication Date 1989
Series ETH, Eidgenössische Technische Hochschule Zürich, Departement Informatik, Institut für Theoretische Informatik 103
Language English
DOI http://dx.doi.org/10.3929/ethz-a-000628392
Subject(s) Software
Discrete Mathematics
Keyword(s) PROGRAMS AND ALGORITHMS FOR THE SOLUTION OF SPECIAL PROBLEMS
DIRECTED GRAPHS
GRAPH ALGORITHMS
Organisational Unit Department of Computer Science
Online Publication Date 2011
Description File Name MIME Type Size
Text   eth-3254-01.pdf application/pdf 1.12MB
Abstract Views and Downloads
Views 14  abstracts
Downloads 22  downloads

Abstract Views and Downloads by Country
Views abstracts
Downloads downloads
Czech Republic Views abstracts
Downloads downloads
France Views abstracts
Downloads downloads
Switzerland Views abstracts
Downloads downloads
United States Views abstracts
Downloads downloads
China Views abstracts
Downloads downloads
Germany Views abstracts
Downloads downloads
India Views abstracts
Downloads downloads
Russian Federation Views abstracts
Downloads downloads
Taiwan Views abstracts
Downloads downloads


E-Collection record created: Mon, 03 Oct 2011, 04:12:54 CET