Directed One-Trees - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Discrete Mathematics and Theoretical Computer Science Année : 2005

Directed One-Trees

William Evans
  • Fonction : Auteur
  • PersonId : 769565
  • IdRef : 171071867

Résumé

We identify the class of directed one-trees and prove the so-called min-max theorem for them. As a consequence, we establish the equality of directed tree-width and a new measure, $d$-width, on this class of graphs. In addition, we prove a property of all directed one-trees and use this property to create an $O(n^2)$ recognition algorithm and an $O(n^2)$ algorithm for solving the Hamiltonian cycle problem on directed one-trees.
Fichier principal
Vignette du fichier
dmAE0114.pdf (139.47 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-01184386 , version 1 (14-08-2015)

Identifiants

Citer

William Evans, Mohammad Ali Safari. Directed One-Trees. 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. pp.67-72, ⟨10.46298/dmtcs.3429⟩. ⟨hal-01184386⟩

Collections

TDS-MACS
133 Consultations
483 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More