Acyclic Digraphs (Q3120435): Difference between revisions

@@ 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.1007/978-3-319-71840-8_3
+Normal rank
@@ Property / OpenAlex ID @@
+W4247505235
@@ Property / OpenAlex ID: W4247505235 / rank @@
+Normal rank
@@ Property / cites work @@
+Paths and trails in edge-colored graphs
@@ Property / cites work: Paths and trails in edge-colored graphs / 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 @@
+On a DAG Partitioning Problem
@@ Property / cites work: On a DAG Partitioning Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum directed cuts in acyclic digraphs
@@ Property / cites work: Maximum directed cuts in acyclic digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Spanning Directed Trees with Many Leaves
@@ Property / cites work: Spanning Directed Trees with Many Leaves / rank @@
+Normal rank
@@ Property / cites work @@
+Physically feasible decomposition of Engino® toy models: A graph-theoretic approach
+Normal rank
@@ Property / cites work @@
+Algorithms for generating convex sets in acyclic digraphs
+Normal rank
@@ Property / cites work @@
+(Arc-)disjoint flows in networks
@@ Property / cites work: (Arc-)disjoint flows in networks / rank @@
+Normal rank
@@ Property / cites work @@
+Digraphs
@@ Property / cites work: Digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3012393
@@ Property / cites work: Q3012393 / rank @@
+Normal rank
@@ Property / cites work @@
+Disjoint directed and undirected paths and cycles in digraphs
+Normal rank
@@ Property / cites work @@
+Small degree out‐branchings
@@ Property / cites work: Small degree out‐branchings / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of multicut and mixed multicut problems in (di)graphs
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph
+Normal rank
@@ Property / cites work @@
+The circular chromatic number of a digraph
@@ Property / cites work: The circular chromatic number of a digraph / rank @@
+Normal rank
@@ Property / cites work @@
+A fixed-parameter algorithm for the directed feedback vertex set problem
+Normal rank
@@ Property / cites work @@
+Q3549698
@@ Property / cites work: Q3549698 / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-Parameter Tractability of Directed Multiway Cut Parameterized by the Size of the Cutset
+Normal rank
@@ Property / cites work @@
+Matrix multiplication via arithmetic progressions
@@ Property / cites work: Matrix multiplication via arithmetic progressions / rank @@
+Normal rank
@@ Property / cites work @@
+Cryptographic Enforcement of Information Flow Policies Without Public Information
+Normal rank
@@ Property / cites work @@
+Q2957516
@@ Property / cites work: Q2957516 / rank @@
+Normal rank
@@ Property / cites work @@
+On Finding Directed Trees with Many Leaves
@@ Property / cites work: On Finding Directed Trees with Many Leaves / rank @@
+Normal rank
@@ Property / cites work @@
+A decomposition theorem for partially ordered sets
+Normal rank
@@ Property / cites work @@
+Optimum branchings
@@ Property / cites work: Optimum branchings / rank @@
+Normal rank
@@ Property / cites work @@
+Some Extremal Properties of Bipartite Subgraphs
@@ Property / cites work: Some Extremal Properties of Bipartite Subgraphs / rank @@
+Normal rank
@@ Property / cites work @@
+The directed subgraph homeomorphism problem
@@ Property / cites work: The directed subgraph homeomorphism problem / rank @@
+Normal rank
@@ Property / cites work @@
+Properly colored paths and cycles
@@ Property / cites work: Properly colored paths and cycles / rank @@
+Normal rank
@@ Property / cites work @@
+Q5616737
@@ Property / cites work: Q5616737 / rank @@
+Normal rank
@@ Property / cites work @@
+Counting acyclic digraphs by sources and sinks
@@ Property / cites work: Counting acyclic digraphs by sources and sinks / rank @@
+Normal rank
@@ Property / cites work @@
+Acyclic subgraphs of planar digraphs
@@ Property / cites work: Acyclic subgraphs of planar digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4195940
@@ Property / cites work: Q4195940 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on the cardinality of certain classes of unlabeled multipartite tournaments
+Normal rank
@@ Property / cites work @@
+An algorithm for finding input-output constrained convex sets in an acyclic digraph
+Normal rank
@@ Property / cites work @@
+Acyclicity in edge-colored graphs
@@ Property / cites work: Acyclicity in edge-colored graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Chinese postman problem on edge-colored multigraphs
+Normal rank
@@ Property / cites work @@
+Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs
+Normal rank
@@ Property / cites work @@
+A probabilistic approach to problems parameterized above or below tight bounds
+Normal rank
@@ Property / cites work @@
+Minimum leaf out-branching and related problems
@@ Property / cites work: Minimum leaf out-branching and related problems / rank @@
+Normal rank
@@ Property / cites work @@
+On the number of connected convex subgraphs of a connected acyclic digraph
+Normal rank
@@ Property / cites work @@
+Q5682013
@@ Property / cites work: Q5682013 / rank @@
+Normal rank
@@ Property / cites work @@
+Planar Digraphs of Digirth Five Are 2-Colorable
@@ Property / cites work: Planar Digraphs of Digirth Five Are 2-Colorable / rank @@
+Normal rank
@@ Property / cites work @@
+Q5538306
@@ Property / cites work: Q5538306 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Parameterized Algorithms for above Average Constraint Satisfaction
+Normal rank
@@ Property / cites work @@
+Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs
+Normal rank
@@ Property / cites work @@
+Uniform random generation of large acyclic digraphs
+Normal rank
@@ Property / cites work @@
+Powers of tensors and fast matrix multiplication
@@ Property / cites work: Powers of tensors and fast matrix multiplication / rank @@
+Normal rank
@@ Property / cites work @@
+Color degree and alternating cycles in edge-colored graphs
+Normal rank
@@ Property / cites work @@
+On the Number of Maximal Vertices of a Random Acyclic Digraph
+Normal rank
@@ Property / cites work @@
+A Dirac Type Condition for Properly Coloured Paths and Cycles
+Normal rank
@@ Property / cites work @@
+An Edge-Colored Version of Dirac's Theorem
@@ Property / cites work: An Edge-Colored Version of Dirac's Theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Properly coloured Hamiltonian cycles in edge-coloured complete graphs
+Normal rank
@@ Property / cites work @@
+Parameterizing above or below guaranteed values
@@ Property / cites work: Parameterizing above or below guaranteed values / rank @@
+Normal rank
@@ Property / cites work @@
+Q3024012
@@ Property / cites work: Q3024012 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3219752
@@ Property / cites work: Q3219752 / rank @@
+Normal rank
@@ Property / cites work @@
+Beyond Max-Cut: \(\lambda\)-extendible properties parameterized above the Poljak-Turzík bound
+Normal rank
@@ Property / cites work @@
+Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph
+Normal rank
@@ Property / cites work @@
+Directed multicut is <i>W</i>[1]-hard, even for four terminal pairs
+Normal rank
@@ Property / cites work @@
+A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound
+Normal rank
@@ Property / cites work @@
+Parameterized algorithms for feedback set problems and their duals in tournaments
+Normal rank
@@ Property / cites work @@
+Q5675746
@@ Property / cites work: Q5675746 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4154580
@@ Property / cites work: Q4154580 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5623707
@@ Property / cites work: Q5623707 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for the Maximum Leaf Spanning Tree Problem on Acyclic Digraphs
+Normal rank
@@ Property / cites work @@
+An improved algorithm for transitive closure on acyclic digraphs
+Normal rank
@@ Property / cites work @@
+Parameterized Tractability of Edge-Disjoint Paths on Directed Acyclic Graphs
+Normal rank
@@ Property / cites work @@
+Acyclic orientations of graphs
@@ Property / cites work: Acyclic orientations of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A matrix for counting paths in acyclic digraphs
@@ Property / cites work: A matrix for counting paths in acyclic digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3808121
@@ Property / cites work: Q3808121 / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-parameter algorithms for DAG partitioning
@@ Property / cites work: Fixed-parameter algorithms for DAG partitioning / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Complexity of DAG Partitioning
@@ Property / cites work: Parameterized Complexity of DAG Partitioning / rank @@
+Normal rank
@@ Property / cites work @@
+Bounded degree acyclic decompositions of digraphs.
+Normal rank
@@ Property / cites work @@
+A note on alternating cycles in edge-coloured graphs
+Normal rank