Results 21 to 30 of about 3,542 (227)
Beyond-Planar Graphs: Simple and Maximal
This thesis revolves around the topic of beyond-planar graphs. Planar graphs are graphs that can be drawn on the plane without any crossings. Beyond-planar graphs are a generalization of planar graphs to sparse non-planar graphs. This generalization is achieved by restricting the edge crossing patterns or the number of crossings.
openaire +2 more sources
OOPS: Optimized One-Planarity Solver via SAT
We present OOPS (Optimized One-Planarity Solver), a practical heuristic for recognizing 1-planar graphs and several important subclasses. A graph is 1-planar if it can be drawn in the plane such that each edge is crossed at most once---a natural ...
Sergey Pupyrev
doaj +1 more source
On-shell structures of MHV amplitudes beyond the planar limit [PDF]
16 pages, 19 ...
Arkani-Hamed, Nima +4 more
openaire +4 more sources
Beyond-Planarity: Density Results for Bipartite Graphs
Beyond-planarity focuses on the study of geometric and topological graphs that are in some sense nearly-planar. Here, planarity is relaxed by allowing edge crossings, but only with respect to some local forbidden crossing configurations. Early research dates back to the 1960s (e.g., Avital and Hanani 1966) for extremal problems on geometric graphs, but
Patrizio Angelini +4 more
openaire +2 more sources
Beyond Grinberg Equation in cubic planar graphs
In this paper, Grinberg equation related to the Hamiltonicity of cubic planar graphs is revisited using the cycle base description of the graph and the related Laplacian. The advantages and the limitations of a pure Algebraic approach to Hamiltonicity are shown. Examples, showing the limitations are presented, too.
Cristian E. ONETE +1 more
openaire +2 more sources
We present robust protocols for the preparation of supported lipid bilayers (SLBs) incorporating either Salmonella smooth LPS or outer membrane vesicles (OMVs). We use a combination of quartz crystal microbalance with dissipation (QCM‐D) and fluorescence microscopy to both characterize the SLBs of various compositions and to probe their interactions ...
Hudson P. Pace +6 more
wiley +1 more source
Streaming Algorithms for Estimating the Matching Size in Planar Graphs and Beyond [PDF]
We consider the problem of estimating the size of a maximum matching when the edges are revealed in a streaming fashion. When the input graph is planar, we present a simple and elegant streaming algorithm that, with high probability, estimates the size of a maximum matching within a constant factor using Õ( n 2/3
Hossein Esfandiari +4 more
openaire +1 more source
Evolutionary analysis across 32 placental mammals identified positive selection at residues H148 and W149 in the immune receptor FcγR1. Ancestral reconstruction combined with molecular dynamics simulations reveals how these mutations may influence receptor structure and dynamics, providing insight into the evolution of antibody recognition and immune ...
David A. Young +7 more
wiley +1 more source
Structural Parameterizations of $k$-Planarity
The concept of $k$-planarity is extensively studied in the context of Beyond Planarity. A graph is $k$-planar if it admits a drawing in the plane in which each edge is crossed at most $k$ times.
Tatsuya Gima +2 more
doaj +1 more source
New features on yttria‐stabilized zirconia after exposure at 1500°C: Newly discovered pyramidal structures on an old material. After exposure at 1550°C on the cross section of YSZ new features, namely pyramidal structures are discovered. These structures grow with time, increase in numbers, appear as singularities, are often arranged in strings, and ...
Doris Sebold +2 more
wiley +1 more source

