Results 21 to 30 of about 1,027 (141)
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
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
On the Path-Width of Integer Linear Programming [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 We consider the feasibility problem of integer linear programming (ILP). We show that solutions of any ILP instance can be naturally represented by an FO-definable class of graphs. For each solution there may be many graphs representing it.
Constantin Enea +3 more
doaj +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
From Pathwidth to Connected Pathwidth [PDF]
, 2011 It is proven that the connected pathwidth of any graph G is at most 2*pw(G)+1, where pw(G) is the pathwidth of G. The method is constructive, i.e. it yields an efficient algorithm that for a given path decomposition of width k computes a connected path ...
Dariusz Dereniowski +1 more
core +1 more source
Pathwidth, trees, and random embeddings [PDF]
Combinatorica, 2013 We prove that, for every $k=1,2,...,$ every shortest-path metric on a graph of pathwidth $k$ embeds into a distribution over random trees with distortion at most $c$ for some $c=c(k)$. A well-known conjecture of Gupta, Newman, Rabinovich, and Sinclair states that for every minor-closed family of graphs $F$, there is a constant $c(F)$ such that the ...
James R. Lee, Anastasios Sidiropoulos
openaire +5 more sources
On the Pathwidth of Almost Semicomplete Digraphs [PDF]
, 2015 We call a digraph {\em $h$-semicomplete} if each vertex of the digraph has at most $h$ non-neighbors, where a non-neighbor of a vertex $v$ is a vertex $u \neq v$ such that there is no edge between $u$ and $v$ in either direction. This notion generalizes that of semicomplete digraphs which are $0$-semicomplete and tournaments which are semicomplete and ...
Kenta Kitsunai +2 more
openaire +4 more sources
The treewidth and pathwidth of hypercubes
Discrete Mathematics, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
L. Sunil Chandran, Telikepalli Kavitha
openaire +1 more source
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