Results 81 to 90 of about 2,730 (147)
VLSI layouts and DNA physical mappings [PDF]
, 1995 We show that an important problem ($k$-ICG) in computational biology is equivalent to a colored version of a well-known graph layout problem ($k$-CVS).Comment: 7 ...
Dinneen, Michael J.
core
On the complexity of freezing automata networks of bounded pathwidth [PDF]
, 2023 Eric Goles +3 more
openalex +1 more source
Selected Papers of the 31st International Workshop on Combinatorial Algorithms, IWOCA 2020. [PDF]
Algorithmica, 2022 Gąsieniec L, Klasing R, Radzik T.
europepmc +1 more source
Pathwidth of outerplanar graphs
, 2006 We are interested in the relation between the pathwidth of a biconnected outerplanar graph and the pathwidth of its (geometric) dual. Bodlaender and Fomin, after having proved that the pathwidth of every biconnected outerplanar graph is always at most twice the pathwidth of its (geometric) dual plus two, conjectured that there exists a constant $c ...
Coudert, David +2 more
openaire +2 more sources
Graph and String Parameters: Connections Between Pathwidth, Cutwidth and the Locality Number [PDF]
arXiv, 2019 We investigate the locality number, a recently introduced structural parameter for strings (with applications in pattern matching with variables), and its connection to two important graph-parameters, cutwidth and pathwidth. These connections allow us to show that computing the locality number is NP-hard, but fixed-parameter tractable, if parameterised
arxiv
, 2017 An anagram is a word of the form $WP$ where $W$ is a non-empty word and $P$ is a permutation of $W$. We study anagram-free graph colouring and give bounds on the chromatic number. Alon et al.
Wilson, Tim E., Wood, David R.
core
Induced subgraphs and tree decompositions XVIII. Obstructions to bounded pathwidth [PDF]
arXivThe pathwidth of a graph $G$ is the smallest $w\in \mathbb{N}$ such that $G$ can be constructed from a sequence of graphs, each on at most $w+1$ vertices, by gluing them together in a linear fashion. We provide a full classification of the unavoidable induced subgraphs of graphs with large pathwidth.
arxiv
Approximation Algorithms for Digraph Width Parameters [PDF]
arXiv, 2011 Several problems that are NP-hard on general graphs are efficiently solvable on graphs with bounded treewidth. Efforts have been made to generalize treewidth and the related notion of pathwidth to digraphs. Directed treewidth, DAG-width and Kelly-width are some such notions which generalize treewidth, whereas directed pathwidth generalizes pathwidth ...
arxiv