Dilworth’s Theorem and Its Application for Path Systems of a Cycle—Implementation and Analysis-Reference-Cited by-同舟云学术

Dilworth’s Theorem and Its Application for Path Systems of a Cycle—Implementation and Analysis

Published:1999 Issue: Volume: Page:498-509
ISSN:0302-9743
Container-title:Algorithms - ESA’ 99
language:
Short-container-title:

Author:

Benczúr András A.,Förster Jörg,Király Zoltán

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-48481-7_43

Reference16 articles.

1. Ahuja, R. K., T. L. Magnanti and J. B. Orlin, Network Flows, Prentice Hall (1993).

2. Benczúr, A. A., J. Förster and Z. Király, Dilworth’s Theorem and its application for path systems of a cycle—implementation and analysis (full paper). Available at http://www.cs.elte.hu/~joergf/ .

3. Cormen, T. H., C. E. Leiserson and R. L. Rivest, Introduction to Algorithms, MIT Press (1990).

4. Frank, A., Finding minimum generators of path systems, submitted to JCT B.

5. Frank, A., Finding minimum weighted generators of a path system, submitted.

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Independent Sets and Hitting Sets of Bicolored Rectangular Families;Algorithmica;2021-02-17

2. All-Pairs Ancestor Problems in Weighted Dags;Combinatorics, Algorithms, Probabilistic and Experimental Methodologies;2007

3. Alternating Paths along Axis-Parallel Segments;Graphs and Combinatorics;2006-12

4. Pushdown–reduce: an algorithm for connectivity augmentation and poset covering problems;Discrete Applied Mathematics;2003-08

5. Alternating Paths along Orthogonal Segments;Lecture Notes in Computer Science;2003