Acyclic Digraphs (Q3120435)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Acyclic Digraphs	scientific article

Statements

scholarly article

0 references

Acyclic Digraphs (English)

0 references

zbMATH Open document ID

0 references

10.1007/978-3-319-71840-8_3

0 references

0 references

Springer Monographs in Mathematics

0 references

publication date

4 March 2019

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-319-71840-8_3

0 references

0 references

Paths and trails in edge-colored graphs

0 references

The Transitive Reduction of a Directed Graph

0 references

On a DAG Partitioning Problem

0 references

Maximum directed cuts in acyclic digraphs

0 references

Spanning Directed Trees with Many Leaves

0 references

Physically feasible decomposition of Engino® toy models: A graph-theoretic approach

0 references

Algorithms for generating convex sets in acyclic digraphs

0 references

(Arc-)disjoint flows in networks

0 references

0 references

0 references

Disjoint directed and undirected paths and cycles in digraphs

0 references

Small degree out‐branchings

0 references

The complexity of multicut and mixed multicut problems in (di)graphs

0 references

A linear-time algorithm to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph

0 references

The circular chromatic number of a digraph

0 references

A fixed-parameter algorithm for the directed feedback vertex set problem

0 references

0 references

Fixed-Parameter Tractability of Directed Multiway Cut Parameterized by the Size of the Cutset

0 references

Matrix multiplication via arithmetic progressions

0 references

Cryptographic Enforcement of Information Flow Policies Without Public Information

0 references

0 references

On Finding Directed Trees with Many Leaves

0 references

A decomposition theorem for partially ordered sets

0 references

Optimum branchings

0 references

Some Extremal Properties of Bipartite Subgraphs

0 references

The directed subgraph homeomorphism problem

0 references

Properly colored paths and cycles

0 references

0 references

Counting acyclic digraphs by sources and sinks

0 references

Acyclic subgraphs of planar digraphs

0 references

0 references

A note on the cardinality of certain classes of unlabeled multipartite tournaments

0 references

An algorithm for finding input-output constrained convex sets in an acyclic digraph

0 references

Acyclicity in edge-colored graphs

0 references

Chinese postman problem on edge-colored multigraphs

0 references

Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs

0 references

A probabilistic approach to problems parameterized above or below tight bounds

0 references

Minimum leaf out-branching and related problems

0 references

On the number of connected convex subgraphs of a connected acyclic digraph

0 references

0 references

Planar Digraphs of Digirth Five Are 2-Colorable

0 references

0 references

Improved Parameterized Algorithms for above Average Constraint Satisfaction

0 references

Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs

0 references

Uniform random generation of large acyclic digraphs

0 references

Powers of tensors and fast matrix multiplication

0 references

Color degree and alternating cycles in edge-colored graphs

0 references

On the Number of Maximal Vertices of a Random Acyclic Digraph

0 references

A Dirac Type Condition for Properly Coloured Paths and Cycles

0 references

An Edge-Colored Version of Dirac's Theorem

0 references

Properly coloured Hamiltonian cycles in edge-coloured complete graphs

0 references

Parameterizing above or below guaranteed values

0 references

0 references

0 references

Beyond Max-Cut: \(\lambda\)-extendible properties parameterized above the Poljak-Turzík bound

0 references

Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph

0 references

Directed multicut is <i>W</i>[1]-hard, even for four terminal pairs

0 references

A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound

0 references

Parameterized algorithms for feedback set problems and their duals in tournaments

0 references

0 references

0 references

0 references

Approximation Algorithms for the Maximum Leaf Spanning Tree Problem on Acyclic Digraphs

0 references

An improved algorithm for transitive closure on acyclic digraphs

0 references

Parameterized Tractability of Edge-Disjoint Paths on Directed Acyclic Graphs

0 references

Acyclic orientations of graphs

0 references

A matrix for counting paths in acyclic digraphs

0 references

0 references

Fixed-parameter algorithms for DAG partitioning

0 references

Parameterized Complexity of DAG Partitioning

0 references

Bounded degree acyclic decompositions of digraphs.

0 references

A note on alternating cycles in edge-coloured graphs

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3120435

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3120435&oldid=36476663"