Minimal equivalent subgraphs containing a given set of arcs (Q528495): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+C60
@@ Property / Mathematics Subject Classification ID: 05C60 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6715038
@@ Property / zbMATH DE Number: 6715038 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+transitive reduction
@@ Property / zbMATH Keywords: transitive reduction / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+transitive closure
@@ Property / zbMATH Keywords: transitive closure / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+minimal equivalent subgraph
@@ Property / zbMATH Keywords: minimal equivalent subgraph / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2017.02.025
+Normal rank
@@ Property / OpenAlex ID @@
+W2593855770
@@ Property / OpenAlex ID: W2593855770 / rank @@
+Normal rank
@@ Property / cites work @@
+The Transitive Reduction of a Directed Graph
@@ Property / cites work: The Transitive Reduction of a Directed Graph / rank @@
+Normal rank
@@ Property / cites work @@
+An Algorithm for Finding a Minimum Equivalent Graph of a Digraph
+Normal rank
@@ Property / cites work @@
+Q2747613
@@ Property / cites work: Q2747613 / rank @@
+Normal rank
@@ Property / cites work @@
+DAG-Width and Parity Games
@@ Property / cites work: DAG-Width and Parity Games / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:528495