Acyclic Digraphs
From MaRDI portal
Publication:3120435
DOI10.1007/978-3-319-71840-8_3zbMath1407.05110OpenAlexW4247505235MaRDI QIDQ3120435
Publication date: 4 March 2019
Published in: Springer Monographs in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-71840-8_3
Related Items (2)
Criterion for a graph to admit a good orientation in terms of leaf blocks ⋮ Realization of a digraph as the Reeb graph of a Morse-Bott function on a given surface
Cites Work
- The complexity of multicut and mixed multicut problems in (di)graphs
- An algorithm for finding input-output constrained convex sets in an acyclic digraph
- Fixed-parameter algorithms for DAG partitioning
- Chinese postman problem on edge-colored multigraphs
- A probabilistic approach to problems parameterized above or below tight bounds
- Properly colored paths and cycles
- Parameterized algorithms for feedback set problems and their duals in tournaments
- Matrix multiplication via arithmetic progressions
- A linear-time algorithm to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph
- Parameterizing above or below guaranteed values
- On the number of connected convex subgraphs of a connected acyclic digraph
- Disjoint directed and undirected paths and cycles in digraphs
- Minimum leaf out-branching and related problems
- Color degree and alternating cycles in edge-colored graphs
- Algorithms for generating convex sets in acyclic digraphs
- A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound
- An improved algorithm for transitive closure on acyclic digraphs
- Counting acyclic digraphs by sources and sinks
- The directed subgraph homeomorphism problem
- A note on alternating cycles in edge-coloured graphs
- Bounded degree acyclic decompositions of digraphs.
- A note on the cardinality of certain classes of unlabeled multipartite tournaments
- Properly coloured Hamiltonian cycles in edge-coloured complete graphs
- A matrix for counting paths in acyclic digraphs
- Acyclicity in edge-colored graphs
- Paths and trails in edge-colored graphs
- (Arc-)disjoint flows in networks
- Beyond Max-Cut: \(\lambda\)-extendible properties parameterized above the Poljak-Turzík bound
- Acyclic subgraphs of planar digraphs
- Acyclic orientations of graphs
- A decomposition theorem for partially ordered sets
- Cryptographic Enforcement of Information Flow Policies Without Public Information
- Fixed-Parameter Tractability of Directed Multiway Cut Parameterized by the Size of the Cutset
- Improved Parameterized Algorithms for above Average Constraint Satisfaction
- Approximation Algorithms for the Maximum Leaf Spanning Tree Problem on Acyclic Digraphs
- On a DAG Partitioning Problem
- Planar Digraphs of Digirth Five Are 2-Colorable
- Parameterized Tractability of Edge-Disjoint Paths on Directed Acyclic Graphs
- Maximum directed cuts in acyclic digraphs
- A fixed-parameter algorithm for the directed feedback vertex set problem
- Powers of tensors and fast matrix multiplication
- On Finding Directed Trees with Many Leaves
- Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs
- On the Number of Maximal Vertices of a Random Acyclic Digraph
- Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph
- The circular chromatic number of a digraph
- Directed multicut is W[1-hard, even for four terminal pairs]
- Small degree out‐branchings
- Parameterized Complexity of DAG Partitioning
- An Edge-Colored Version of Dirac's Theorem
- Spanning Directed Trees with Many Leaves
- Physically feasible decomposition of Engino® toy models: A graph-theoretic approach
- A Dirac Type Condition for Properly Coloured Paths and Cycles
- Digraphs
- Optimum branchings
- The Transitive Reduction of a Directed Graph
- Some Extremal Properties of Bipartite Subgraphs
- Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs
- Uniform random generation of large acyclic digraphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Acyclic Digraphs
