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...

Full description

Saved in:

Bibliographic Details
Published in:	Discrete Applied Mathematics Vol. 312; pp. 72 - 85
Main Authors:	Mescoff, Guillaume, Paul, Christophe, Thilikos, Dimitrios M.
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 15.05.2022 Elsevier BV Elsevier
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!