A polynomial time algorithm to compute the connected treewidth of a series–parallel graph

It is well known that the treewidth of a graph G corresponds to the node search number where a team of searchers is pursuing a fugitive that is lazy and invisible (or alternatively is agile and visible) and has the ability to move with infinite speed via unguarded paths. Recently, monotone and conne...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Discrete Applied Mathematics Ročník 312; s. 72 - 85
Hlavní autori:	Mescoff, Guillaume, Paul, Christophe, Thilikos, Dimitrios M.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Amsterdam Elsevier B.V 15.05.2022 Elsevier BV Elsevier
Predmet:	Algorithms Apexes Combinatorial algorithms Computer Science Connected treewidth Discrete Mathematics Dynamic programming Graph classes Graph decompositions Graph theory Graphs Polynomials Run time (computers) Search methods series–parallel graphs Treewidth Width parameters Combinatorial algorithms series–parallel graphs Graph decompositions Connected treewidth Graph classes Dynamic programming Width parameters Treewidth
ISSN:	0166-218X, 1872-6771
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!