Minimal equivalent subgraphs containing a given set of arcs (Q528495): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2017.02.025 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2593855770 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Transitive Reduction of a Directed Graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Algorithm for Finding a Minimum Equivalent Graph of a Digraph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q2747613 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: DAG-Width and Parity Games / rank | |||
Normal rank | |||
Latest revision as of 19:59, 13 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimal equivalent subgraphs containing a given set of arcs |
scientific article |
Statements
Minimal equivalent subgraphs containing a given set of arcs (English)
0 references
12 May 2017
0 references
transitive reduction
0 references
transitive closure
0 references
minimal equivalent subgraph
0 references
