Results 101 to 110 of about 584,165 (157)
Horizontal visibility graph of a random restricted growth sequence. [PDF]
Adv Appl Math, 2021 Mansour T, Rastegar R, Roitershtein A.
europepmc +1 more source
From Planar via Outerplanar to Outerpath – Engineering NP-Hardness Constructions (Poster Abstract)
A typical question in graph drawing is to determine, for a given graph drawing style, the boundary between polynomial-time solvability and NP-hardness. For two examples from the area of drawing graphs with few slopes, we sharpen this boundary. We suggest
Zink, Johannes, Geis, Joshua
core +1 more source
Strongly-Connected Outerplanar Graphs with Proper Touching Triangle Representations
, 2013 A proper touching triangle representation R of an n-vertex planar graph consists of a triangle divided into n non-overlapping triangles. A pair of triangles are considered to be adjacent if they share a partial side of positive length. Each triangle in R
Fowler, J. Joseph, J. Joseph Fowler
core +1 more source
Clustering systems of phylogenetic networks. [PDF]
Theory Biosci, 2023 Hellmuth M, Schaller D, Stadler PF.
europepmc +1 more source
Maximally Expressive Graph Neural Networks for Outerplanar Graphs
We propose a linear time graph transformation that enables the Weisfeiler-Leman (WL) algorithm and message passing graph neural networks (MPNNs) to be maximally expressive on outerplanar graphs.
Gärtner, Thomas; orcid: +8 more
core
On the k-Structure Ratio in Planar and Outerplanar Graphs
Discrete Mathematics & Theoretical Computer Science, 2008 A planar k-restricted structure is a simple graph whose blocks are planar and each has at most k vertices. Planar k-restricted structures are used by approximation algorithms for Maximum Weight Planar Subgraph, which motivates this work. The planar k-
Gruia Calinescu, Cristina G. Fernandes
doaj
Oriented coloring of 2-outerplanar graphs
, 2007 A graph G is 2-outerplanar if it has a planar embedding such that the subgraph obtained by removing the vertices of the outer face is outerplanar. The oriented chromatic number of an oriented graph H is defined as the minimum order of an oriented graph H'
Esperet, Louis, Ochem, Pascal
core
Maximally Expressive GNNs for Outerplanar Graphs
We propose a linear time graph transformation that enables the Weisfeiler-Leman (WL) algorithm and message passing graph neural networks (MPNNs) to be maximally expressive on outerplanar graphs.
Gärtner, Thomas; orcid: +8 more
core +2 more sources