Maximum Directed Cuts in Acyclic Digraphs

Journal of Graph Theory - United States
doi 10.1002/jgt.20215
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Wiley

Related search

A Matrix for Counting Paths in Acyclic Digraphs

Journal of Combinatorial Theory - Series A
CombinatoricsComputational TheoryDiscrete MathematicsTheoretical Computer ScienceMathematics
1996English

A Note on Directed 5-Cycles in Digraphs

Applied Mathematics
2012English

Maximum Cuts in Edge-Colored Graphs

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2019English

Lightness of Digraphs in Surfaces and Directed Game Chromatic Number

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2009English

Edge Weight Reduction Problems in Directed Acyclic Graphs

Journal of Algorithms
1997English

Directed Acyclic Graphs With Edge-Specific Bounds

Biometrika
StatisticsProbabilityUncertaintyApplied MathematicsBiological SciencesAgriculturalMathematics
2011English

Verification of Directed Acyclic Ad Hoc Networks

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

Finding Disjoint Paths on Directed Acyclic Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Max-Linear Models on Directed Acyclic Graphs

Bernoulli
StatisticsProbability
2018English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy