Efficient algorithms for measuring the funnel-likeness of DAGs-Reference-Cited by-同舟云学术

Efficient algorithms for measuring the funnel-likeness of DAGs

Published:2019-11-07 Issue:1 Volume:39 Page:216-245
ISSN:1382-6905
Container-title:Journal of Combinatorial Optimization
language:en
Short-container-title:J Comb Optim

Author:

Garlet Millani Marcelo,Molter Hendrik,Niedermeier Rolf,Sorge Manuel

Funder

Deutsche Forschungsgemeinschaft

FP7 People: Marie-Curie Actions

Israel Science Foundation

H2020 European Research Council

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications

Link

http://link.springer.com/content/pdf/10.1007/s10878-019-00464-4.pdf

Reference34 articles.

1. Agrawal A, Saurabh S, Sharma R, Zehavi M (2018) Kernels for deletion to classes of acyclic digraphs. J Comput Syst Sci 92:9–21

2. Agrawal A, Saurabh S, Sharma R, Zehavi M (2018) Parameterised algorithms for deletion to classes of DAGs. Theory Comput Syst 62(8):1880–1909

3. Ailon N, Alon N (2007) Hardness of fully dense problems. Inf Comput 205(8):1117–1129

4. Bang-Jensen J, Gutin G (2018) Classes of directed graphs. Springer Monographs in Mathematics Springer. Springer, Berlin

5. Bang-Jensen J, Gutin GZ (2009) Digraphs: theory, algorithms and applications. Springer, Berlin

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

1. Backdoor DNFs;Journal of Computer and System Sciences;2024-09

2. Width Helps and Hinders Splitting Flows;ACM Transactions on Algorithms;2024-03-13

3. Directed Ear Anonymity;Lecture Notes in Computer Science;2024

4. A safety framework for flow decomposition problems via integer linear programming;Bioinformatics;2023-10-20

5. Improving RNA Assembly via Safety and Completeness in Flow Decompositions;Journal of Computational Biology;2022-12-01