Results 41 to 50 of about 1,033 (146)
The Effect of Planarization on Width
Journal of Graph Algorithms and Applications, 2018 We study the effects on graph width parameters of planarization, the construction of a planar diagram from a non-planar graph drawing by replacing each crossing with a new vertex. We show that for treewidth, pathwidth, branchwidth, clique-width, and tree-
David Eppstein
doaj +1 more source
Pathwidth and Nonrepetitive List Coloring
The Electronic Journal of Combinatorics, 2016 A vertex coloring of a graph is nonrepetitive if there is no path in the graph whose first half receives the same sequence of colors as the second half. While every tree can be nonrepetitively colored with a bounded number of colors (4 colors is enough), Fiorenzi, Ochem, Ossona de Mendez, and Zhu recently showed that this does not extend to the list ...
Gagol, Adam +3 more
openaire +6 more sources
The Bounded Pathwidth of Control-Flow Graphs
, 2023 Pathwidth and treewidth are standard and well-studied graph sparsity parameters which intuitively model the degree to which a given graph resembles a path or a tree, respectively.
Goharshady, Amir Kafshdar +2 more
core +1 more source
On the Complexity of Embedding in Graph Products
Computing in Geometry and TopologyGraph embedding, especially as a subgraph of a grid, is an old topic in VLSI design and graph drawing. In this paper, we investigate related questions concerning the complexity of embedding a graph G in a host graph that is the strong product of a path ...
Therese Biedl +2 more
doaj +1 more source
The Pebble-Relation Comonad in Finite Model Theory [PDF]
Logical Methods in Computer ScienceThe pebbling comonad, introduced by Abramsky, Dawar and Wang, provides a categorical interpretation for the k-pebble games from finite model theory.
Yoàv Montacute, Nihil Shah
doaj +1 more source
Treewidth and pathwidth of permutation graphs [PDF]
SIAM Journal on Discrete Mathematics, 1993 This paper is the first one in a series of articles using scanlines in intersection models of graphs. The new concept enables to prove that every minimal triangulation of a permutation graph into a chordal graph is an interval graph, a result that generalizes to minimal triangulations of asteroidal-triple free graphs [Discrete Appl. Math.
Hans L. Bodlaender +2 more
openaire +4 more sources
On Approximating Cutwidth and Pathwidth
2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS)We study graph ordering problems with a min-max objective. A classical problem of this type is cutwidth, where given a graph we want to order its vertices such that the number of edges crossing any point is minimized. We give a $ \log^{1+o(1)}(n)$ approximation for the problem, substantially improving upon the previous poly-logarithmic guarantees based
Nikhil Bansal 0001 +2 more
openaire +3 more sources
1-Planarity of Graphs with a Rotation System
Journal of Graph Algorithms and Applications, 2015 A graph is 1-planar if it can be drawn in the plane such that each edge is crossed at most once. 1-planarity is known NP-hard, even for graphs of bounded bandwidth, pathwidth, or treewidth, and for near-planar graphs in which an edge is added to a planar
Christopher Auer +3 more
doaj +1 more source
Exclusive graph searching vs. pathwidth [PDF]
, 2017 In Graph Searching, a team of searchers aims at capturing an invisible fugitive moving arbitrarily fast in a graph. Equivalently, the searchers try to clear a contaminated network.
Markou E., Nisse N., Pérennes S.
core +2 more sources
A linear fixed parameter tractable algorithm for connected pathwidth [PDF]
, 2020 The graph parameter of pathwidth can be seen as a measure of the topological resemblance of a graph to a path. A popular definition of pathwidth is given in terms of node search where we are given a system of tunnels that is contaminated by some ...
Thilikos, Dimitrios M. +3 more
core +2 more sources