Results 101 to 110 of about 414,139 (194)
A fast parallel algorithm for optimal edge-colouring of outerplanar graphs [PDF]
We prove that every outerplanar graph can be optimally edge-coloured in polylog time using a polynomial number of processors on a parallel random access machine without write conflicts (P-RAM)
Gibbons, Alan (Alan M.) +1 more
core
Parallel O(log(n)) time edge-colouring of trees and Halin graphs [PDF]
We present parallel O(log(n))-time algorithms for optimal edge colouring of trees and Halin graphs with n processors on a a parallel random access machine without write conflicts (P-RAM).
Gibbons, Alan (Alan M.) +2 more
core
Indonesian Journal of CombinatoricsA planar graph is said to be zonal when is possible to label its vertices with the nonzero elements of ℤ3, in such a way that the sum of the labels of the vertices on the boundary of each zone is 0 in ℤ3.
Christian Barrientos, Sarah Minion
doaj +1 more source
Embedding Vertices at Points: Few Bends Suffice for Planar Graphs
Journal of Graph Algorithms and Applications, 2002 The existing literature gives efficient algorithms for mapping trees or less restrictively outerplanar graphs on a given set of points in a plane, so that the edges are drawn planar and as straight lines.
Michael Kaufmann, Roland Wiese
doaj +1 more source
Zero Forcing on 2-connected Outerplanar Graphs [PDF]
, 2023 We determine upper and lower bounds on the zero forcing number of 2-connected outerplanar graphs in terms of the structure of the weak dual. We show that the upper bound is always at most half the number of vertices of the graph.
Kenter, Franklin +2 more
core +1 more source
On Large Induced Outerplanar Subgraphs in $2$-Outerplanar Graphs
CoRRBorradaile, Le and Sherman-Bennett [Graphs and Combinatorics, 2017] proved that every $n$-vertex $2$-outerplane graph has a set of at least $2n/3$ vertices that induces an outerplane graph. We identify a major flaw in their proof and recover their result with a different, and unfortunately much more complex, proof.
Marco D'Elia, Fabrizio Frati
openaire +2 more sources
On the Upward Planarity of Mixed Plane Graphs
Journal of Graph Algorithms and Applications, 2014 A mixed plane graph is a plane graph whose edge set is partitioned into a set of directed edges and a set of undirected edges. An orientation of a mixed plane graph G is an assignment of directions to the undirected edges of G resulting in a directed ...
Fabrizio Frati +4 more
doaj +1 more source
Column planarity and partially-simultaneous geometric embedding
Journal of Graph Algorithms and Applications, 2017 We introduce the notion of column planarity of a subset $R$ of the vertices of a graph $G$. Informally, we say that $R$ is column planar in $G$ if we can assign $x$-coordinates to the vertices in $R$ such that any assignment of $y$-coordinates to ...
Luis Barba +5 more
doaj +1 more source
Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends
Journal of Graph Algorithms and Applications, 2016 Given two planar graphs that are defined on the same set of vertices, a RAC simultaneous drawing is a drawing of the two graphs where each graph is drawn planar, no two edges overlap, and edges of one graph can cross edges of the other graph only ...
Michael Bekos +3 more
doaj +1 more source
Special Issue Dedicated to the 16th International Symposium on Parameterized and Exact Computation. [PDF]
Algorithmica, 2022 Golovach PA, Zehavi M.
europepmc +1 more source