On the complexity of the planar edge-disjoint paths problem with terminals on the outer boundary (Q2149491): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Edge-disjoint paths in planar graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the complexity of the disjoint paths problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Multicommodity flows in planar graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: NP-completeness of some edge-disjoint paths problems / rank | |||
Normal rank |
Latest revision as of 11:30, 29 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the complexity of the planar edge-disjoint paths problem with terminals on the outer boundary |
scientific article |
Statements
On the complexity of the planar edge-disjoint paths problem with terminals on the outer boundary (English)
0 references
29 June 2022
0 references