Daniel Meister Jan Arne Telle

icon

114

pages

icon

English

icon

Documents

Écrit par

Publié par

Lire un extrait
Lire un extrait

Obtenez un accès à la bibliothèque pour le consulter en ligne En savoir plus

Découvre YouScribe en t'inscrivant gratuitement

Je m'inscris

Découvre YouScribe en t'inscrivant gratuitement

Je m'inscris
icon

114

pages

icon

English

icon

Documents

Lire un extrait
Lire un extrait

Obtenez un accès à la bibliothèque pour le consulter en ligne En savoir plus

Chordal digraphs Daniel Meister Jan Arne Telle

  • closely related

  • many graph-theoretic

  • difficult problems

  • famous graph


Voir icon arrow

Publié par

Nombre de lectures

11

Langue

English

Chordal digraphs
Daniel Meister Jan Arne TelleChordal digraphs
Daniel Meister Jan Arne Telle
Department of Informatics, University of Bergen, NorwayOverview
Chordal digraphs
Daniel Meister Jan Arne Telle
Department of Informatics, University of Bergen, Norway
Chordal digraphsOverview
Chordal graphs
important and famous graph class
with many graph-theoretic and algorithmic applications
Chordal digraphsOverview
Chordal graphs
important and famous graph class
with many graph-theoretic and algorithmic applications
Chordal graphs
closely related to treewidth and
efficient solvability of difficult problems
Chordal digraphsOverview
Chordal graphs
important and famous graph class
with many graph-theoretic and algorithmic applications
Chordal graphs
closely related to treewidth and
efficient solvability of difficult problems
Chordal graphs
appear in many applications directly or as important subproblem
Chordal digraphsOverview
Chordal graphs
important and famous graph class
with many graph-theoretic and algorithmic applications
What is a/the
Chordal grphs
closely related to treewidth and
efficient solvability of difficult problems
directed analogue?
Chordal graphs
appear in many applications directly or as important subproblem
Chordal digraphsOverview
What is a/the directed analogue?
class should be big enough to contain enough structure,
class should be small enough to admit efficient solutions
Chordal digraphsOverview
Outline of the talk
1 Everybody’s darlings: chordal (undirected) graphs
2 Introducing: chordal digraphs
3 Characterisations of chordal digraphs
4 Forbidden subgraphs of semicomplete chordal digraphs
Chordal digraphs
0Chordal (undirected) graphs
Presentation part
1 Everybody’s darlings: chordal (undirected) graphs
2 Introducing: chordal digraphs
3 Characterisations of chordal digraphs
4 Forbidden subgraphs of semicomplete chordal digraphs
Chordal digraphs
1

Voir icon more
Alternate Text