论文信息 - The complexity of finding maximum disjoint paths with length constraints

The complexity of finding maximum disjoint paths with length constraints

A discharge luminescence element array comprising a pair of parallel insulating plates and a separator entirely sealed between the pair of insulating plates in which a groove-like gas flow path is provided between one of the plates and the separator for evacuating and providing gas from and to discharge spaces defined by the separator and the pair of insulating plates.

[1] J. W. Suurballe. Disjoint paths in a network , 1974, Networks.

[2] Robert E. Tarjan,et al. Network Flow and Testing Graph Connectivity , 1975, SIAM J. Comput..

[3] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.

[4] Harold N. Gabow,et al. An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs , 1976, JACM.