Exact and Approximate Digraph Bandwidth

In this paper, we introduce a directed variant of the classical Bandwidth problem and study it from the view-point of moderately exponential time algorithms, both exactly and approximately. Motivated by the definitions of the directed variants of the classical Cutwidth and Pathwidth problems, we def...

Full description

Bibliographic Details

Published in:	Theory of computing systems Vol. 69; no. 1; p. 10
Main Authors:	Jain, Pallavi, Kanesh, Lawqueen, Lochet, Willian, Saurabh, Saket, Sharma, Roohani
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.03.2025 Springer Nature B.V
Subjects:	Algorithms Apexes Bandwidths Computer Science Graph theory Graphs Theory of Computation Approximation scheme Exact exponential algorithms Directed bandwidth
ISSN:	1432-4350, 1433-0490
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!