Acyclic digraphs
From MaRDI portal
Recommendations
Cites work
- (Arc-)disjoint flows in networks
- A decomposition theorem for partially ordered sets
- A Dirac type condition for properly coloured paths and cycles
- A fixed-parameter algorithm for the directed feedback vertex set problem
- A linear-time algorithm to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph
- A matrix for counting paths in acyclic digraphs
- A note on alternating cycles in edge-coloured graphs
- A note on the cardinality of certain classes of unlabeled multipartite tournaments
- A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound
- A probabilistic approach to problems parameterized above or below tight bounds
- Acyclic orientations of graphs
- Acyclic subgraphs of planar digraphs
- Acyclicity in edge-colored graphs
- Algorithms for generating convex sets in acyclic digraphs
- An algorithm for finding input-output constrained convex sets in an acyclic digraph
- An Edge-Colored Version of Dirac's Theorem
- An improved algorithm for transitive closure on acyclic digraphs
- Approximation algorithms for the maximum leaf spanning tree problem on acyclic digraphs
- Beyond Max-Cut: \(\lambda\)-extendible properties parameterized above the Poljak-Turzík bound
- Bounded degree acyclic decompositions of digraphs.
- Chinese postman problem on edge-colored multigraphs
- Color degree and alternating cycles in edge-colored graphs
- Counting acyclic digraphs by sources and sinks
- Cryptographic enforcement of information flow policies without public information
- Digraphs
- Directed acyclic subgraph problem parameterized above the Poljak-Turzík bound
- Disjoint directed and undirected paths and cycles in digraphs
- Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph
- Fixed-parameter algorithms for DAG partitioning
- Fixed-parameter algorithms in analysis of heuristics for extracting networks in linear programs
- Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset
- scientific article; zbMATH DE number 2186891 (Why is no real title available?)
- scientific article; zbMATH DE number 3887060 (Why is no real title available?)
- scientific article; zbMATH DE number 5485529 (Why is no real title available?)
- scientific article; zbMATH DE number 4077268 (Why is no real title available?)
- scientific article; zbMATH DE number 3585466 (Why is no real title available?)
- scientific article; zbMATH DE number 3635493 (Why is no real title available?)
- scientific article; zbMATH DE number 3249566 (Why is no real title available?)
- scientific article; zbMATH DE number 3340124 (Why is no real title available?)
- scientific article; zbMATH DE number 3348134 (Why is no real title available?)
- scientific article; zbMATH DE number 3409391 (Why is no real title available?)
- scientific article; zbMATH DE number 3419161 (Why is no real title available?)
- Improved parameterized algorithms for above average constraint satisfaction
- Matrix multiplication via arithmetic progressions
- Maximum directed cuts in acyclic digraphs
- Minimum leaf out-branching and related problems
- On a DAG partitioning problem
- On finding directed trees with many leaves
- On the number of connected convex subgraphs of a connected acyclic digraph
- On the Number of Maximal Vertices of a Random Acyclic Digraph
- Optimum branchings
- Out-branchings with extremal number of leaves
- Parameterized algorithms for feedback set problems and their duals in tournaments
- Parameterized complexity of DAG partitioning
- Parameterized tractability of edge-disjoint paths on directed acyclic graphs
- Parameterizing above or below guaranteed values
- Paths and trails in edge-colored graphs
- Physically feasible decomposition of Engino{\circledR} toy models: a graph-theoretic approach
- Planar digraphs of digirth five are 2-colorable
- Powers of tensors and fast matrix multiplication
- Properly colored paths and cycles
- Properly coloured Hamiltonian cycles in edge-coloured complete graphs
- Small degree out‐branchings
- Some Extremal Properties of Bipartite Subgraphs
- Spanning directed trees with many leaves
- The circular chromatic number of a digraph
- The complexity of multicut and mixed multicut problems in (di)graphs
- The directed subgraph homeomorphism problem
- The Transitive Reduction of a Directed Graph
- Uniform random generation of large acyclic digraphs
Cited in
(12)- Acyclic digraphs and local hierarchy theory
- Criterion for a graph to admit a good orientation in terms of leaf blocks
- scientific article; zbMATH DE number 5501202 (Why is no real title available?)
- An Algorithm for Networks of Rules
- scientific article; zbMATH DE number 165071 (Why is no real title available?)
- scientific article; zbMATH DE number 475591 (Why is no real title available?)
- Some inequalities for orderings of acyclic digraphs
- Counting acyclic orderings in directed acyclic graphs
- Realization of a digraph as the Reeb graph of a Morse-Bott function on a given surface
- Reeb graphs of Morse-Bott functions on a given surface
- Ternary directed acyclic word graphs
- Nonderogatory unicyclic digraphs
This page was built for publication: Acyclic digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3120435)
