Linear time algorithms for two disjoint paths problems on directed acyclic graphs

被引：0
|
作者：
Institut für Informatik, Universität Augsburg, 86135 Augsburg, Germany [1 ]
机构：
来源：
Theor Comput Sci | / 35-48期
关键词：
Compilation and indexing terms; Copyright 2024 Elsevier Inc;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Clustering algorithms - Graphic methods - Data structures
引用
收藏
相关论文
共 2 条
  • [1] A nearly linear time algorithm for the half integral parity disjoint paths packing problem
    Kawarabayashi, Ken-Ichi
    Reed, Bruce
    Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 2009, : 1183 - 1192
  • [2] Linear time recognition algorithms and structure theorems for bipartite tolerance graphs and bipartite probe interval graphs
    Department of Mathematics and Statistics, Utah State University, Logan, UT 84341-3900, United States
    不详
    不详
    Discrete Math. Theor. Comput. Sci., 5 (63-82):
1