A linear time algorithm for the induced disjoint paths problem in planar graphs (Q414938)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A linear time algorithm for the induced disjoint paths problem in planar graphs |
scientific article; zbMATH DE number 6033518
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A linear time algorithm for the induced disjoint paths problem in planar graphs |
scientific article; zbMATH DE number 6033518 |
Statements
A linear time algorithm for the induced disjoint paths problem in planar graphs (English)
0 references
11 May 2012
0 references
disjoint paths
0 references
induced subgraph
0 references
planar graph
0 references
linear time algorithm
0 references
0.893372118473053
0 references
0.8810352087020874
0 references
0.8515673279762268
0 references
0.8402684330940247
0 references
0.8253254890441895
0 references
