Minimal equivalent subgraphs containing a given set of arcs

DOI10.1016/J.TCS.2017.02.025zbMATH Open1369.05151OpenAlexW2593855770MaRDI QIDQ528495FDOQ528495

Arne C. Reimers, Alexandra-M. Reimers, Yaron Goldstein

Publication date: 12 May 2017

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2017.02.025

zbMATH Keywords

transitive closuretransitive reductionminimal equivalent subgraph

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Introduction to algorithms
• The Transitive Reduction of a Directed Graph
• DAG-Width and Parity Games
• An Algorithm for Finding a Minimum Equivalent Graph of a Digraph

Cited In (2)

• Generic flux coupling analysis
• Title not available (Why is that?)

This page was built for publication: Minimal equivalent subgraphs containing a given set of arcs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q528495)