Skip to Main content Skip to Navigation
Theses

Graph Searches with Applications to Cocomparability Graphs

Abstract : This thesis contains a global study on graph searches, introducing a new formal madel to study graph search. But also we study the applications of known graph searches such as LBFS (Lexicographic Breadth First Search), LDFS (Lexicographic Depth First Search) on cocomparability graphs. To this aim we mainly study the maximal antichain lattice of a partial order. Two new graph searches LexUP and LexDown are proposed and their first properties studied.
Complete list of metadata

Cited literature [51 references]  Display  Hide  Download

https://hal.inria.fr/tel-01273352
Contributor : Michel Habib Connect in order to contact the contributor
Submitted on : Friday, February 12, 2016 - 12:13:03 PM
Last modification on : Saturday, November 20, 2021 - 3:49:32 AM

Identifiers

  • HAL Id : tel-01273352, version 1

Collections

Citation

Jérémie Dusart. Graph Searches with Applications to Cocomparability Graphs. Computer Science [cs]. Université Denis Diderot Paris 7, 2014. English. ⟨tel-01273352⟩

Share

Metrics

Record views

102

Files downloads

200