Results 21 to 30 of about 1,033 (146)
2-Layer Graph Drawings with Bounded Pathwidth
Journal of Graph Algorithms and Applications, 2023 This paper determines which properties of 2-layer drawings characterise bipartite graphs of bounded pathwidth.
David Wood
doaj +1 more source
On the Pathwidth of Planar Graphs [PDF]
, 2006 Fomin and Thilikos in [5] conjectured that there is a constant $c$ such that, for every $2$-connected planar graph $G$, {pw}(G^*) \leq 2\text{pw}(G)+c$ (the same question was asked simutaneously by Coudert, Huc and Sereni in [4]). By the results of Boedlander and Fomin [2] this holds for every outerplanar graph and actually is tight by Coudert, Huc and
Amini, Omid +2 more
core +6 more sources
Effect of Steaming as Postprocessing Method on Rice Flour and Jaggery 3D Printed Construct
Journal of Food Quality, Volume 2022, Issue 1, 2022., 2022 In this study, the 3D printing of a traditional South Indian snack, “sweet pidikollukattai” has been attempted. The mixing properties of the rice flour used and thermal characteristics of the paste (rice flour, jaggery, and water) have been reported. The traditional form of the product (control) was compared with the 3D printed product, which has been ...
S. Thangalakshmi +7 more
wiley +1 more source
Order Reconfiguration under Width Constraints
Journal of Graph Algorithms and Applications, 2023 In this work, we consider the following order reconfiguration problem: Given a graph $G$ together with linear orders $\omega$ and $\omega'$ of the vertices of $G$, can one transform $\omega$ into $\omega'$ by a sequence of swaps of adjacent elements in ...
Emmanuel Arrighi +3 more
doaj +1 more source
Constrained Connectivity in Bounded X-Width Multi-Interface Networks
Algorithms, 2020 As technology advances and the spreading of wireless devices grows, the establishment of interconnection networks is becoming crucial. Main activities that involve most of the people concern retrieving and sharing information from everywhere.
Alessandro Aloisio, Alfredo Navarra
doaj +1 more source
Exclusive Graph Searching vs. Pathwidth [PDF]
, 2014 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.The problem is to compute the minimum number of searchers required to ...
Markou, Euripides +2 more
core +5 more sources
Pathwidth vs Cocircumference [PDF]
SIAM Journal on Discrete MathematicsThe {\em circumference} of a graph $G$ with at least one cycle is the length of a longest cycle in $G$. A classic result of Birmelé (2003) states that the treewidth of $G$ is at most its circumference minus $1$. In case $G$ is $2$-connected, this upper bound also holds for the pathwidth of $G$; in fact, even the treedepth of $G$ is upper bounded by its
Marcin Briański +2 more
openaire +5 more sources
Crossing Number for Graphs with Bounded Pathwidth [PDF]
Algorithmica, 2020 The crossing number is the smallest number of pairwise edge-crossings when drawing a graph into the plane. There are only very few graph classes for which the exact crossing number is known or for which there at least exist constant approximation ratios.
Therese Biedl +3 more
openaire +5 more sources
A General Reduction Theorem with Applications to Pathwidth and the Complexity of MAX 2-CSP [PDF]
, 2015 We prove a general reduction theorem which allows us to extend bounds for certain graph parameters on cubic graphs to bounds for general graphs taking into account the individual vertex degrees.
Edwards, Keith, McDermid, Eric
core +1 more source
Drawing Halin-graphs with small height
Journal of Graph Algorithms and Applications, 2022 In this paper, we study how to draw Halin-graphs, i.e., planar graphs that consist of a tree $T$ and a cycle among the leaves of that tree. Based on tree-drawing algorithms and the pathwidth $pw(T) $, a well-known graph parameter, we find poly-line ...
Therese Biedl, Milap Sheth
doaj +1 more source