Minimal equivalent subgraphs containing a given set of arcs
type: Item
instance of: scholarly article
title: Minimal equivalent subgraphs containing a given set of arcs
zbMATH Open document ID: 1369.05151
author: Arne C. Reimers
author: Alexandra-M. Reimers
author: Yaron Goldstein
published in: Theoretical Computer Science
publication date: 2017-05-12T00:00:00Z
Mathematics Subject Classification ID: 05C60
zbMATH DE Number: 6715038
zbMATH Keywords: transitive reduction
zbMATH Keywords: transitive closure
zbMATH Keywords: minimal equivalent subgraph
MaRDI profile type: Publication
full work available at URL: j.tcs.2017.02.025
OpenAlex ID: W2593855770
cites work: The Transitive Reduction of a Directed Graph
cites work: An Algorithm for Finding a Minimum Equivalent Graph of a Digraph
cites work: Introduction to algorithms
cites work: DAG-Width and Parity Games
DOI: 10.1016/J.TCS.2017.02.025
description: scientific article; zbMATH DE number 6715038