| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4651636 | Electronic Notes in Discrete Mathematics | 2015 | 6 Pages |
Abstract
We have considered the problem of finding vertex-disjoint dipaths in flowgraphs and we observed an interesting min-max relation: given a flowgraph G, the minimum size of a dominator cover in G is equal to the maximum size of a junction partition of G. In many optimization problems those relations are closely related to efficient algorithms to solve them.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
