 |
 |
|
|
| HAL: hal-00005640, version 1 |
| Detailed view |  Export this paper |
 |
| (2001) |
|
|
|
|
| An algorithm to find a Kuratowski subdivision in DFS cotree critical graphs |
|
|
| Hubert De Fraysseix 1Patrice Ossona De Mendez 1 |
|
|
| (2001) |
|
|
|
| We present a simple linear time algorithm finding a Kuratowski subdivision in a DFS cotree critical graphs, based on recent theoretical results. For sake of clarity, we shall outline the proofs of the Theorem we make use of. This algorithm is the last part of the two step linear time Kuratowski finding algorithm implemented in PIGALE (``Public Implementation of a Graph Algorithm Library and Editor'') |
|
|
|
|
|
|
|
|
|
|
|
| 1: | Centre d'analyse et de mathématique sociale (CAMS) |
|
|
|
CNRS : UMR8557 – École des Hautes Études en Sciences Sociales [EHESS] |
|
|
|
|
|
|
|
|
|
| Subject | : | Mathematics/Combinatorics |
| hal-00005640, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00005640 | |
| oai:hal.archives-ouvertes.fr:hal-00005640 | |
| From: Patrice Ossona De Mendez | |
| Submitted on: Monday, 27 June 2005 00:21:25 | |
| Updated on: Monday, 27 June 2005 00:21:25 | |
